Skip to main content
Log in

The berth allocation problem: models and solution methods

  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract.

In this paper, we consider the problem of allocating space at berth for vessels with the objective of minimizing total weighted flow time. Two mathematical formulations are considered where one is used to develop a tree search procedure while the other is used to develop a lower bound that can speed up the tree search procedure. Furthermore, a composite heuristic combining the tree search procedure and pair-wise exchange heuristic is proposed for large size problems. Finally, computational experiments are reported to evaluate the efficiency of the methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yongpei Guan.

Additional information

Correspondence to: Raymond K. Cheung

The authors would like to thank the helpful comments of two anonymous referees and the editors. The research was supported in part by Grant HKUST6039/01E of the Research Grant Council of Hong Kong

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guan, Y., Cheung, R.K. The berth allocation problem: models and solution methods. OR Spectrum 26, 75–92 (2004). https://doi.org/10.1007/s00291-003-0140-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-003-0140-8

Keywords:

Navigation