Exact and heuristic methods to solve the berth allocation problem in bulk ports

Transportation Research Part E: Logistics and Transportation Review

Volumn 54, Issue , 2013, Pages 14-31

  Umang, Nitish ^a   Bierlaire, Michel ^a   Vacca, Ilaria ^a  

^a EPFL   (Switzerland)

Author keywords

Berth allocation; Bulk ports; Mixed integer programming; Set partitioning; Squeaky wheel optimization

Indexed keywords

HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; TRANSFER CASES (VEHICLES); WHEELS;

BERTH ALLOCATION; BERTH ALLOCATION PROBLEM; BULK PORT; EXACT METHODS; MIXED-INTEGER PROGRAMMING; NUMERICAL EXPERIMENTS; SERVICE TIME; SET PARTITIONING; SET PARTITIONING METHOD; SQUEAKY WHEEL OPTIMIZATIONS;

HEURISTIC METHODS;

BULK CARGO; HEURISTICS; LINEAR PROGRAMING; OPTIMIZATION; PORT OPERATION; VESSEL;

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

References (39)

1. Bierwirth C., Meisel F. A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research 2010, 202(3):615-627.
2. Buhrkal K., Zuglian S., Ropke S., Larsen J., Lusby R. Models for the discrete berth allocation problem: a computational comparison. Transportation Research Part E 2011, 47(4):461-473.
3. Chang D., Yan W., Chen C.-H., Jiang Z. A berth allocation strategy using heuristics algorithm and simulation optimisation. International Journal of Computer Applications in Technology 2008, 32:272-281.
4. Cheong C., Tan K., Liu D., Lin C. Multi-objective and prioritized berth allocation in container ports. Annals of Operations Research 2010, 180:63-103.
5. Christensen, C.G., Holst, C.T., 2008. Berth allocation in container terminals. Master's thesis, Technical University of Denmark.
6. Clements, D., Crawford, J., Joslin, D., Nemhauser, G.L., Puttlitz, M., Savelsbergh, M.W.P., 1997. Heuristic optimization: A hybrid ai/or approach. In: Proceedings of the Workshop on Industrial Constraint-Directed Scheduling.
7. 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.
8. Dai J., Lin W., Moorthy R., Teo C.P. Berth allocation planning optimization in container terminals. International Series in Operations Research & Management Science 2008, vol. 119:69-104. Springer. C.S. Tang, C.P. Teo, K.K. Wei (Eds.).
9. Fu Z., Li C.L., Lim A., Rodrigues B. Port space allocation with a time dimension. JORS 2007, 58:797807.
10. Gao, C., Zhang, R., Du, Y., Chen, Q., 2010. A proactive and reactive framework for berth allocation with uncertainties. In: IEEE International Conference on Advanced Management Science (ICAMS), 2010, vol. 3, pp. 144-149.
11. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979, Freeman & Co., New York.
12. Guan Y., Cheung R.K. The berth allocation problem: models and solution methods. OR Spectrum 2004, 26:75-92.
13. Guan Y., Xiao W.-Q., Cheung R.K., Li C.-L. A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Operations Research Letters 2002, 30(5):343-350.
14. Han X.-l., Lu Z.-q., Xi L.-f. A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. European Journal of Operational Research 2010, 207(3):1327-1340.
15. Imai A., Nagaiwa K., Chan W.T. Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 1997, 31(1):75-94.
16. 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.
17. Imai A., Nishimura E., Papadimitriou S. The dynamic berth allocation problem for a container port. Transportation Research Part B 2001, 35(4):401-417.
18. Imai A., Nishimura E., Papadimitriou S. Berth allocation with service priority. Transportation Research Part B 2003, 37(5):437-457.
19. 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:136-151.
20. 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.
21. Joslin, D., Clements, D., 1998. "squeaky wheel" optimization. In: AAAI'98 Proceedings of the National Conference on Artificial Intelligence.
22. Kim K.H., Moon K.C. Berth scheduling by simulated annealing. , Transportation Research Part B 2003, 37(6):541-560.
23. Li C.L., Cai X., Lee C.Y. Scheduling with multiple-job-on-one-processor pattern. IIE Transactions 1998, 30:433-445.
24. Lim A. The berth planning problem. Operations Research Letters 1998, 22(2-3):105-110.
25. Lim A., Rodrigues B., Xiao F., Zhu Y. Crane scheduling with spatial constraints. Naval Research Logistics 2004, 51:386-406.
26. Mauri G., Oliveira A., Lorena L. A hybrid column generation approach for the berth allocation problem. Lecture Notes in Computer Science 2008, vol. 4972:110-122. Springer, Berlin/Heidelberg. J. van Hemert, C. Cotta (Eds.).
27. Meisel F., Bierwirth C. Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Research Part E 2008, 45(1):196-209.
28. Monaco M.F., Sammarra M. The berth allocation problem: a strong formulation solved by a Lagrangean approach. Transportation Science 2007, 41(2):265-280.
29. Moorthy R., Teo C.P. Berth management in container terminal: the template design problem. OR Spectrum 2006, 28(4):495-518.
30. 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.
31. 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.
32. Park Y.M., Kim K.H. A scheduling method for berth and quay cranes. OR Spectrum 2003, 25(1):1-23.
33. Pinedo M. Scheduling: Theory, Algorithms, and Systems 2002, Prentice Hall, Englewood Cliffs.
34. Smith, T.B., Pyle, J.M., 2004. An effective algorithm for project scheduling with arbitrary temporal constraints. In: AAAI'04 Proceedings of the 19th National Conference on Artificial Intelligence, pp. 544-549.
35. Stahlbock R., Voss S. Operations research at container terminals: a literature update. OR Spectrum 2008, 30(1):1-52.
36. Steenken D., Voss S., Stahlbock R. Container terminal operation and operations research - a classification and literature review. OR Spectrum 2004, 26(1):3-49.
37. Tong C., Lau H., Lim A. Ant colony optimization for the ship berthing problem. Lecture Notes in Computer Science 1999, vol. 1742. Springer, 789-789. P. Thiagarajan, R. Yap (Eds.).
38. Vacca, I., 2011. Container terminal management: integrated models and large-scale optimization algorithms. PhD thesis, Ecole Polytechnique Fédérale de Lausanne.
39. Zhou P.-f., Kang H.-g. Study on berth and quay-crane allocation under stochastic environments in container terminal. Systems Engineering - Theory & Practice 2008, 28(1):161-169.