The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution

Transportation Research Part E: Logistics and Transportation Review

Volumn 46, Issue 6, 2010, Pages 1017-1029

  Lee, Der Horng ^a   Chen, Jiang Hang ^a   Cao, Jin Xin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Berth Allocation Problem; Container terminals; GRASP

Indexed keywords

HEURISTIC ALGORITHMS; RESERVATION SYSTEMS; TRANSFER CASES (VEHICLES);

ADAPTIVE SEARCH; BERTH ALLOCATION PROBLEM; CONTAINER TERMINAL; DYNAMIC BERTH ALLOCATION; FLOW-TIME; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; NEAR-OPTIMAL SOLUTIONS; SMALL SCALE; SPACE DIAGRAMS; TIME-SPACE;

STOCHASTIC SYSTEMS;

CONTAINER TERMINAL; NUMERICAL METHOD; RESOURCE ALLOCATION; STOCHASTICITY;

EID: 77954316066     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2010.01.009     Document Type: Article

References (26)

1. Chazelle B. The bottomn-left bin-packing heuristic: an efficient implementation. IEEE Transactions on Computers 1983, 32(8):697-707.
2. Cordeau J., Laporte G., Legato P., Moccia L. Models and tabu search heuristics for the berth-allocation problem. Transportation science 2005, 39(4):526-538.
3. Dai J., Lin W., Moorthy R., Teo C. Berth allocation planning optimization in container terminal. Supply Chain Analysis: A Handbook on the Interaction of Information, System and Optimization 2007, 69.
4. Guan Y., Cheung R. The berth allocation problem: models and solution methods. OR Spectrum 2004, 26(1):75-92.
5. Guan Y., Xiao W., Cheung R., Li C. A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Operations Research Letters 2002, 30(5):343-350.
6. Hansen P., Oĝuz C., Mladenović N. Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research 2008, 191(3):636-649.
7. Henesey, L., Davidsson, P., Persson, J., 2004. Using simulation in evaluating berth allocation at a container terminal. In: Proceedings for the 3 rd International Conference on Computer Applications and Information Technology in the Maritime Industries (COMPIT 04). pp. 61-72.
8. Imai A., Nagaiwa K., Chan W. Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 1997, 31(1):75-94.
9. Imai A., Nishimura E., Papadimitriou S. The dynamic berth allocation problem for a container port. Transportation Research Part B 2001, 35(4):401-417.
10. Imai A., Nishimura E., Papadimitriou S. Berth allocation with service priority. Transportation Research Part B 2003, 37(5):437-457.
11. Imai A., Sun X., Nishimura E., Papadimitriou S. Berth allocation in a container port: using a continuous location space approach. Transportation Research Part B 2005, 39(3):199-221.
12. Imai A., Nishimura E., Hattori M., Papadimitriou S. Berth allocation at indented berths for mega-containerships. European Journal of Operational Research 2007, 179(2):579-593.
13. Imai A., Nishimura E., Papadimitriou S. Berthing ships at a multi-user container terminal with a limited quay capacity. Transportation Research Part E 2008, 44(1):136-151.
14. Kim K., Moon K. Berth scheduling by simulated annealing. Transportation Research Part B 2003, 37(6):541-560.
15. Kim K.H., Park Y.M. A crane scheduling method for port container terminals. European Journal of Operational Research 2004, 156(3):752-768.
16. Lee Y., Chen C. An optimization heuristic for the berth scheduling problem. European Journal of Operational Research 2009, 196(2):500-508.
17. Legato P., Mazza R. Berth planning and resources optimisation at a container terminal via discrete event simulation. European Journal of Operational Research 2001, 133(3):537-547.
18. Li C., Cai X., Lee C. Scheduling with multiple-job-on-one-processor pattern. IIE Transactions 1998, 30(5):433-445.
19. Lim A. The berth planning problem. Operations Research Letters 1998, 22(2-3):105-110.
20. Monaco M., Sammarra M. The berth allocation problem: a strong formulation solved by a Lagrangian approach. Transportation Science 2007, 41(2):265.
21. Moorthy R., Teo C. Berth management in container terminal: the template design problem. OR Spectrum 2006, 28(4):495-518.
22. Nishimura E., Imai A., Papadimitriou S. Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research 2001, 131(2):282-292.
23. Park K., Kim K. Berth scheduling for container terminals by using a sub-gradient optimization technique. Journal of the Operational Research Society 2002, 53(9):1054-1062.
24. Resende M., Ribeiro C. Greedy randomized adaptive search procedures. International Series in Operations Research and Management Science 2003, 219-250.
25. Tong C., Lau H., Lim A. Ant Colony Optimization for the ship Berthing problem. Lecture Notes in Computer Science 1999, 359-370.
26. Wang F., Lim A. A stochastic beam search for the berth allocation problem. Decision Support Systems 2007, 42(4):2186-2196.