The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach

M. Flavia Monaco () and Marcello Sammarra ()
Additional contact information
M. Flavia Monaco: Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, via Pietro Bucci 41C, 87036 Rende (Cosenza), Italy
Marcello Sammarra: Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, via Pietro Bucci 41C, 87036 Rende (Cosenza), Italy

Transportation Science, 2007, vol. 41, issue 2, 265-280

Abstract: The berth allocation problem is one of the most relevant logistics problems arising in the management of container ports. Depending on assumptions made on the berthing location policy, two classes of the berth allocation problem have been considered in literature: the discrete case and the continuous case. In this paper, the properties of the discrete berth allocation problem, formulated as a dynamic scheduling problem, are analyzed. A new formulation of the problem is proposed, which is shown to be more compact and stronger than another one from the literature; a Lagrangean heuristic algorithm is developed; and computational results are presented.

Keywords: berth allocation; terminal management; scheduling; Lagrangean relaxation; heuristics (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (33)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1060.0171 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:41:y:2007:i:2:p:265-280

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().