TY - JOUR
T1 - An optimization heuristic for the berth scheduling problem
AU - Lee, Yusin
AU - Chen, Chuen Yih
N1 - Funding Information:
This research is partially supported by the National Science Council funds 95-2221-E-006-433 and 93-2211-E-006-046.
PY - 2009/7/16
Y1 - 2009/7/16
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=58149231340&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=58149231340&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2008.03.021
DO - 10.1016/j.ejor.2008.03.021
M3 - Article
AN - SCOPUS:58149231340
SN - 0377-2217
VL - 196
SP - 500
EP - 508
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 2
ER -