Variable neighborhood search for minimum cost berth allocation
Authors:
- Pierre HansenPHPierre Hansen
- Ceyda OğuzCOCeyda Oğuz
- Nenad MladenovićNMNenad Mladenović
- 1 December 2008
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 191 (3) , 636-649
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A decision support system for operations in a container terminalDecision Support Systems, 2005
- Transshipment of containers at a container terminal: An overviewEuropean Journal of Operational Research, 2003
- Berth scheduling for container terminals by using a sub-gradient optimization techniqueJournal of the Operational Research Society, 2002
- Berth planning and resources optimisation at a container terminal via discrete event simulationEuropean Journal of Operational Research, 2001
- Berth allocation planning in the public berth system by genetic algorithmsEuropean Journal of Operational Research, 2001
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- The berth planning problemOperations Research Letters, 1998
- Variable neighborhood searchComputers & Operations Research, 1997
- Efficient planning of berth allocation for container terminals in AsiaJournal of Advanced Transportation, 1997
- A study of container berth allocationJournal of Advanced Transportation, 1992