An optimization heuristic for the berth scheduling problem

Yusin Lee and Chuen-Yih Chen

European Journal of Operational Research, 2009, vol. 196, issue 2, 500-508

Abstract: Berths are among the most important resources in a port. In this research we present an optimization-based approach for the berth scheduling problem, which is to determine the berthing time and space for each incoming ship. The neighborhood-search based heuristic treats the quay as a continuous space. In additional to basic physical requirements, this model takes several factors important in practice into consideration, including the first-come-first-served rule, clearance distance between ships, and possibility of ship shifting. Computational experience is provided.

Keywords: Logistics; Berthing; Threshold; accepting; Integer; programming; Optimization (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00313-5
Full text for ScienceDirect subscribers only

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:eee:ejores:v:196:y:2009:i:2:p:500-508

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().