Title: Exact and heuristic methods for placing ships in locks
Authors: Verstichel, Jannes ×
De Causmaecker, Patrick
Spieksma, Frits
Vanden Berghe, Greet #
Issue Date: 1-Jun-2014
Publisher: Elsevier
Series Title: European Journal of Operational Research vol:235 issue:2 pages:387-398
Abstract: The ship placement problem constitutes a daily challenge for planners in tide river harbours. In essence, it entails positioning a set of ships into as few lock chambers as possible while satisfying a number of general and specific placement constraints. These constraints make the ship placement problem different from traditional 2D bin packing.
A mathematical formulation for the problem is presented. In addition, a decomposition model is developed which allows for computing optimal solutions in a reasonable time. A multi-order best fit heuristic for the ship placement problem is introduced, and its performance is compared with that of the left-right-left-back heuristic. Experiments on simulated and real-life instances show that the multi-order best fit heuristic beats the other heuristics by a landslide, while maintaining comparable calculation times. Finally, the new heuristic's optimality gap is small, while it clearly outperforms the exact approach with respect to calculation time.
ISSN: 0377-2217
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Computer Science Technology TC, Technology Campuses Ghent and Aalst
Technologiecluster Computerwetenschappen
Computer Science, Campus Kulak Kortrijk
Research Center for Operations Research and Business Statistics (ORSTAT), Leuven
Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
1-s2.0-S0377221713005523-main.pdf Published 849KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science