Models for the discrete berth allocation problem: A computational comparison

Transportation Research Part E: Logistics and Transportation Review

Volumn 47, Issue 4, 2011, Pages 461-473

  Buhrkal, Katja ^a   Zuglian, Sara ^a   Ropke, Stefan ^a   Larsen, Jesper ^a   Lusby, Richard ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Berth allocation problem; Container terminals; Mixed integer programming

Indexed keywords

PORT TERMINALS; RAILROAD YARDS AND TERMINALS; RESERVATION SYSTEMS; TRANSFER CASES (VEHICLES);

BERTH ALLOCATION PROBLEM; COMPUTATIONAL COMPARISONS; CONTAINER TERMINAL; DISCRETE DYNAMICS; DYNAMIC BERTH ALLOCATION; MIXED-INTEGER PROGRAMMING; NUMERICAL TESTS; PERFORMANCE; SET PARTITIONING;

INTEGER PROGRAMMING;

CONTAINER TERMINAL; NUMERICAL MODEL; PERFORMANCE ASSESSMENT; RESOURCE ALLOCATION; SHIPPING;

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

References (32)

1. Chen C.S., Lee S.M., Shen Q.S. An analytical model for the container loading problem. European Journal of Operational Research 1995, 80:68-76.
2. Christensen, C.G., Holst, C.T., 2008. Berth Allocation in Container Terminals. Master's Thesis, Department of Informatics and Mathematical Modelling, Technical University of Denmark, April (in Danish).
3. Cordeau J.-F., Laporte G., Legato P., Moccia L. Models and tabu search heuristics for the berth-allocation problem. Transportation Science 2005, 39(4):526-538.
4. Dai, J., Lin, W., Moorthy, R., Teo,C.-P. 2004. Berth Allocation Planning Optimization in Container Terminal. Unpublished Manuscript, June.
5. Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 1992, 40(2):342-354.
6. Desrochers M., Laporte G. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 1991, 10:27-36.
7. Guan Y., Cheung R.K. The berth allocation problem: models and solution methods. OR Spectrum 2004, 26:75-92.
8. Guan Y., Xiao W.-Q., Cheung R.K., Lee C.-L. A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Operations Research Letters 2002, 30:343-350.
9. Hansen P., Oguz C., Mladenovic N. Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research 2008, 191:636-649.
10. Imai A., Chen H.C., Nishimura E., Papadimitriou S. The simultaneous berth and quay crane allocation problem. Transportation Research Part E 2008, 44:900-920.
11. Imai A., Nagaiwa K., Tat C.W. Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 1997, 31(1):75-94.
12. Imai A., Nishimura E., Papadimitriou S. The dynamic berth allocation problem for a container port. Transportation Research Part B 2001, 35:401-417.
13. Imai A., Nishimura E., Papadimitriou S. Berth allocation with service priority. Transportation Research Part B 2003, 37:437-457.
14. Imai A., Sun X., Nishimura E., Papadimitriou S. Berth allocation in a container port: using a continuous location space approach. Transportation Science Part B 2005, 39:199-221.
15. Kim K.H., Moon K.C. Berth scheduling by simulated annealing. Transportation Research Part B 2003, 37:541-560.
16. Legato, P., Monaco, F., Tigani, N., 2001. Berth Planning at Gioia Tauro's Maritime Terminal by Logistic Distribution Models. Annual Conf., AIRO, Cagliari, Itlay.
17. Liang C., Huang Y., Yang Y. A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Computers & Industrial Engineering 2009, 56:1021-1028.
18. Lim A. The berth planning problem. Operations Research Letters 1998, 22:105-110.
19. Mauri G.R., Oliveira A.C.M., Lorena L.A.N. A hybrid column generation approach for the berth allocation problem. Lecture Notes in Computer Science 2008, vol. 4972:110-122. Springer. J. van emert, C. Cotta (Eds.).
20. Meisel F., Bierwirth C. Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Research Part E 2009, 45:196-209.
21. Monaco M.F., Sammarra M. The berth allocation problem: a strong formulation solved by a lagrangean approach. Transportation Science 2007, 41(2):265-280.
22. Murata, H., Fujiyoshi, K., Nakatake, S., Kajitani, Y. 1995. Rectangle-packing-based module placement. In: Proceedings of the 1995 IEEE/ACM International Conference on Computer-aided Design. IEEE/ACM, November, pp. 472-479.
23. Nishimura E., Imai A., Papadimitriou S. Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research 2001, 131:282-292.
24. Onodera, H., Taniguche, Y., Tmaru, K., 1991. Branch-and-bound placement for building block layout. In: 28th ACM/IEEE Design Automation Conference, pp. 433-439.
25. Padberg M.W. Perfect zero-one matrices. Mathematical Programming 1974, 6:180-196.
26. Park K.T., Kim K.H. Berth scheduling for container terminals by using a sub-gradient optimization technique. Journal of the Operational Research Society 2002, 53:1054-1062.
27. Park Y.-M., Kim K.H. A scheduling method for berth and quay cranes. OR Spectrum 2003, 25:1-23.
28. Ryan D.M., Foster B.A. An integer programming approach to scheduling. Computer Scheduling of Public Transport 1981, 269-280. North-Holland Publishing Company. A. Wren (Ed.).
29. Steenken D., Voss S., Stahlbock R. Container terminal operation and operations research - a classification and literature review. OR Spectrum 2004, 26:3-49.
30. Tong C.J., Lau H.C., Lim A. Ant colony optimization for the ship berthing problem. Lecture Notes in Computer Science 1999, vol. 1742:359-370. Springer. P.S. Thiagarajan, R. Yap (Eds.).
31. United Nations, UNCTAD Secretariat, Review of Maritime Transport 2008, 2008, United Nations Publications, United Nations Conference on Trade and Development.
32. Wang F., Lim A. A stochastic beam search for the berth allocation problem. Decision Support Systems 2007, 42:2186-2196.