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.
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
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen C-Y, Hsieh T-W (1998) A time-space network model for the berth allocation problem. First International Conference of Maritime Engineering and Ports, Genoa
Brown G, Cormican K, Lawphogpanich S, Widdis D (1997) Optimizing submarine berthing with a persistence incentive. Naval Research Logistics 44, 301–318
Daganzo C (1989) The crane scheduling problem. Transportation Research B 23B, 159–175
Guan Y, Xiao W-Q, Cheung RK, Li C-L (2002) A multiprocessor task scheduling model for berth allocation: heuristic and worst case analysis. Operations Research Letters 30, 343–350
Held M, Karp RM (1971) The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming 1, 6–25
Hadjiconstantinous E, Christofides N (1995) An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operational Research 83, 39–56
Imai A, Nagaiwa K, Chan WT (1997) Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 31, 75–94
Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transportation Research B 35, 401–417
Kim KH, Moon KC (2003) Berth scheduling by simulated annealing. Transportation Research B 37(6), 541–560
Lai KK, K Shih (1992) A study of container berth allocation. Journal of Advanced Transportation 26, 45–60
Li C-L, Cai X, Lee C-Y (1998) Scheduling with multiple-job-on-one-processor pattern. IIE Transactions 30, 433–445
Lim A (1998) The berth planning problem. Operations Research Letters 22, 105–110
Peterkofsky RI, Daganzo CF (1990) A branch and bound solution method for the crane scheduling problem. Transportation Research B 24B(3), 159–172
Sim CW, Lin LS, Soon NH (1992) Berth allocation in the port of Singapore Authority: a total approach. Proceedings of the First Singapore International Conference on Intelligent Systems, 237–241
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Guan, Y., Cheung, R.K. (2005). The berth allocation problem: models and solution methods. In: Günther, HO., Kim, K.H. (eds) Container Terminals and Automated Transport Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26686-0_6
Download citation
DOI: https://doi.org/10.1007/3-540-26686-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22328-3
Online ISBN: 978-3-540-26686-0
eBook Packages: Business and EconomicsBusiness and Management (R0)