The berth allocation problem: models and solution methods

Yongpei Guan () and Raymond K. Cheung ()
Additional contact information
Yongpei Guan: George Institute of Technology
Raymond K. Cheung: The Hong Kong University of Science and Technology

A chapter in Container Terminals and Automated Transport Systems, 2005, pp 141-158 from Springer

Abstract: 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.

Keywords: Berth allocation; Tree search procedure; Heuristics (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-3-540-26686-0_6

Ordering information: This item can be ordered from
http://www.springer.com/9783540266860

DOI: 10.1007/3-540-26686-0_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().