A Disjunctive Graph Solution Representation for the Continuous and Dynamic Berth Allocation Problem
摘要
In this paper, the continuous and dynamic Berth Allocation Problem is studied to minimize the makespan. A disjunctive graph solution representation is proposed as an alternative to the widely used sequence-based representation. Novel local search algorithms are proposed for the studied problem and embedded in an Iterated Local Search metaheuristic. Numerical tests are carried out on randomly generated instances to compare the two solution representation approaches with the results showing that the proposed approach can be successfully deployed to provide good quality solutions for instances of the problem.