An optimization heuristic for the berth scheduling problem

Yusin Lee, Chuen Yih Chen

Research output: Contribution to journalArticlepeer-review

74 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)500-508
Number of pages9
JournalEuropean Journal of Operational Research
Issue number2
Publication statusPublished - 2009 Jul 16

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint Dive into the research topics of 'An optimization heuristic for the berth scheduling problem'. Together they form a unique fingerprint.

Cite this