An exact algorithm for the integrated planning of berth allocation and quay crane assignment

Vacca, Ilaria and Salani, Matteo and Bierlaire, Michel (2013) An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Science, 47 (2). pp. 148-161. ISSN 1526-5447

Text 2013_VaccaSalaniBierlaire.pdf - Published Version Restricted to Registered users only Download (337kB)

Abstract

In this paper we study the simultaneous optimization of berth allocation and quay crane assignment in seaport container terminals. We propose a model based on an exponential number of variables that is solved via column generation. An exact branch and price algorithm is implemented to produce optimal integer solutions to the problem. In particular, we present several accelerating techniques for the master and the pricing problem that can be generalized to other branch and price schemes. Computational results show that the proposed approach outperforms commercial solvers. Furthermore, the developed algorithm allows for a comparative analysis between the hierarchical and the integrated solution approach that confirms the added value of integration in terms of cost reduction and efficient use of resources. To the best of our knowledge, this is the first exact branch and price algorithm for both the berth allocation problem and the berth allocation problem with quay crane assignment.

Item Type:	Scientific journal article, Newspaper article or Magazine article
Uncontrolled Keywords:	Container terminal management; berth allocation; quay crane assignment; integrated planning; column generation; branch and price
Subjects:	Mathematical sciences > Operational research
Department/unit:	Dipartimento tecnologie innovative > Istituto Dalle Molle di studi sull’intelligenza artificiale USI-SUPSI
Depositing User:	Matteo Salani
Date Deposited:	13 Mar 2014 14:40
Last Modified:	23 May 2016 13:24
URI:	http://repository.supsi.ch/id/eprint/3934

Actions (login required)

View Item