Authors: Hansen, Pierre
Oǧuz, Ceyda
Mladenović, Nenad 
Title: Variable neighborhood search for minimum cost berth allocation
Journal: European Journal of Operational Research
Volume: 191
Issue: 3
First page: 636
Last page: 649
Issue Date: 16-Dec-2008
Rank: M21
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.12.057
The berth allocation problem is to allocate space along the quayside to incoming ships at a container terminal in order to minimize some objective function. We consider minimization of total costs for waiting and handling as well as earliness or tardiness of completion, for all ships. We assume ships can arrive at any given time, i.e., before or after the berths become available. The resulting problem, which subsumes several previous ones, is expressed as a linear mixed 0-1 program. As it turns out to be too time-consuming for exact solution of instances of realistic size, a Variable Neighborhood Search (VNS) heuristic is proposed, and compared with Multi-Start (MS), a Genetic Search algorithm (GA) and a Memetic Search algorithm (MA). VNS provides optimal solutions for all instances solved to optimality in a previous paper of the first two authors and outperforms MS, MA and GA on large instances.
Keywords: Berth allocation | Earliness | Genetic search | Handling | Heuristic | Lateness | Memetic search | Metaheuristic | Variable neighborhood search | Waiting
Publisher: Elsevier
Project: The Hong Kong Polytechnic University, Project No. G-T247

Show full item record


checked on Sep 16, 2022

Page view(s)

checked on Sep 28, 2022

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.