AbstractIn this paper the discrete and dynamic berth allocation problem is formulated as a multi-objective combinatorial optimization problem where vessel service is differentiated upon based on priority agreements. A genetic algorithms based heuristic is developed to solve the resulting problem. A number of numerical experiments showed that the heuristic performed well in solving large, real life instances. The heuristic provided a complete set of solutions that enable terminal operators to evaluate various berth scheduling policies and select the schedule that improves operations and customer satisfaction. The proposed algorithm outperformed a state of the art metaheuristic and provided improved results when compared to the weighted approach.
Berth scheduling by customer service differentiation: A multi-objective approach
Transportation Research Part E: Logistics and Transportation Review ; 45 , 6 ; 878-892
2009-05-27
15 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Berth scheduling by customer service differentiation: A multi-objective approach
Online Contents | 2009
|Berth scheduling by customer service differentiation: A multi-objective approach
Online Contents | 2009
|A Multi-Objective Approach in the Berth Allocation Planning
British Library Conference Proceedings | 1994
|Discrete Berth-Scheduling Problem
Transportation Research Record | 2010
|