This paper considers a classical ship scheduling problem in which the routing and scheduling of a heterogeneous fleet of ships with time windows for pick-ups and deliveries at multiple ports is required. Assuming fixed ship speeds, the problem of maximising profit is addressed. A variable neighborhood search metaheuristic is proposed for this problem. A computational evaluation compares this variable neighborhood search procedure with multi-start local search and a previous tabu search approach. Computational results show that variable neighborhood search provides both the best-quality solutions and the fastest computation time compared to multi-start and tabu search. © 2011 Springer-Verlag.
CITATION STYLE
Malliappi, F., Bennell, J. A., & Potts, C. N. (2011). A variable neighborhood search heuristic for tramp ship scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6971 LNCS, pp. 273–285). https://doi.org/10.1007/978-3-642-24264-9_21
Mendeley helps you to discover research relevant for your work.