The berth allocation problem: Models and solution methods

OR Spectrum

Volumn 26, Issue 1, 2004, Pages 75-92

  Guan, Yongpei ^a   Cheung, Raymond K ^b  

^a Georgia Institute of Technology   (United States)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Berth allocation; Heuristics; Tree search procedure

Indexed keywords

EID: 17444376768     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-003-0140-8     Document Type: Article

References (14)

1. 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
2. Brown G, Cormican K, Lawphogpanich S, Widdis D (1997) Optimizing submarine berthing with a persistence incentive. Naval Research Logistics 44, 301-318
3. Daganzo C (1989) The crane scheduling problem. Transportation Research B 23B, 159-175
4. 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
5. Held M, Karp RM (1971) The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming 1, 6-25
6. Hadjiconstantinous E, Christofides N (1995) An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operational Research 83, 39-56
7. Imai A, Nagaiwa K, Chan WT (1997) Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 31, 75-94
8. Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transportation Research B 35, 401-417
9. Kim KH, Moon KC (2003) Berth scheduling by simulated annealing. Transportation Research B 37(6), 541-560
10. Lai KK, K Shih (1992) A study of container berth allocation. Journal of Advanced Transportation 26, 45-60
11. Li C-L, Cai X, Lee C-Y (1998) Scheduling with multiple-job-on-one- processor pattern. IIE Transactions 30, 433-445
12. Lim A (1998) The berth planning problem. Operations Research Letters 22, 105-110
13. Peterkofsky RI, Daganzo CF (1990) A branch and bound solution method for the crane scheduling problem. Transportation Research B 24B(3), 159-172
14. 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.