An exact algorithm for the integrated planning of berth allocation and quay crane assignment

Transportation Science

Volumn 47, Issue 2, 2013, Pages 148-161

  Vacca, Ilaria ^a   Salani, Matteo ^b   Bierlaire, Michel ^a  

^a EPFL   (Switzerland)

^b DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Berth allocation; Branch and price; Column generation; Container terminal management; Integrated planning; Quay crane assignment

Indexed keywords

CONTAINERS; COST REDUCTION; COSTS; CRANES; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; PORT TERMINALS; RAILROAD YARDS AND TERMINALS; RESERVATION SYSTEMS;

BERTH ALLOCATION; BRANCH AND PRICE; COLUMN GENERATION; CONTAINER TERMINAL MANAGEMENT; INTEGRATED PLANNING; QUAY CRANES;

TRANSFER CASES (VEHICLES);

EID: 84877952268     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1120.0428     Document Type: Article

References (31)

1. Addis B, Carello G, Ceselli A (2012) Exactly solving a twolevel location problem with modular node capacities. Network 59(1): 161-180.
2. Barnhart C, Belobaba P, Odoni AR (2003) Applications of operations research in the air transport industry. Transportation Sci. 37(4): 368-391.
3. Beasley JE, Christofides N (1989) An algorithm for the resource constrained shortest path problem. Networks 19(3): 379-394.
4. Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202(3): 615-627.
5. Buhrkal K, Zuglian S, Ropke S, Larsen J, Lusby R (2011) Models for the discrete berth allocation problem: A computational comparison. Transportation Res. Part E 47(4): 461-473.
6. Choo S, Klabjan D, Simchi-Levi D (2010) Multiship crane sequencing with yard congestion constraints. Transportation Sci. 44(1): 98-115.
7. Christiansen M, Fagerholt K, Ronen D (2004) Ship routing and scheduling: Status and perspectives. Transportation Sci. 38(1): 1-18.
8. Cordeau JF, Laporte G, Legato P, Moccia L (2005) Models and tabu search heuristics for the berth-allocation problem. Transportation Sci. 39(4): 526-538.
9. Dell'Amico M, Righini G, Salani M (2006) A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Sci. 40(2): 235-247.
10. du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math. 194: 229-237.
11. Gélinas E, Desrochers G, Desrosiers J, Solomon M (1995) A new branching strategy for time constrained routing problems with application to backhauling. Ann. Oper. Res. 61(1): 91-109.
12. Giallombardo G, Moccia L, Salani M, Vacca I (2010) Modeling and solving the tactical berth allocation problem. Transportation Res. Part B 44(2): 232-245.
13. Grønhaug R, Christiansen M, Desaulniers G, Desrosiers J (2010) A branch-and-price method for a liquefied natural gas inventory routing problem. Transportation Sci. 44(3): 400-415.
14. Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transportation Res. Part B 35(4): 401-417.
15. Imai A, Chen HC, Nishimura E, Papadimitriou S (2008) The simultaneous berth and quay crane allocation problem. Transportation Res. Part E 44(5): 900-920.
16. ISL (2009) Shipping statistics and market review (SSMR)-Short comment, Vol. 53. Institute of Shipping Economics and Logistics, http://www.isl.org.
17. Liberatore F, Righini G, Salani M (2011) A column generation algorithm for the vehicle routing problem with soft time windows. 4OR: A Quart. J. Oper. Res. 9(1): 49-82.
18. Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6): 1007-1023.
19. Mauri G, Oliveira A, Lorena L (2008) A hybrid column generation approach for the berth allocation problem. van Hemert J, Cotta C, eds. Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 4972. (Springer, Berlin/Heidelberg), 110-122.
20. Meisel F, Bierwirth C (2009) Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Res. Part E 45(1): 196-209.
21. Park YM, Kim KH (2003) A scheduling method for berth and quay cranes. OR Spectrum 25(1): 1-23.
22. Righini G, Salani M (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3): 255-273.
23. Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained shortest path problem. Networks 51(3): 155-170.
24. Rousseau L-M, Gendreau M, Feillet D (2007) Interior point stabilization for column generation. Oper. Res. Lett. 35(5): 660-668.
25. Stahlbock R, Voss S (2008) Operations research at container terminals: A literature update. OR Spectrum 30(1): 1-52.
26. Steenken D, Voss S, Stahlbock R (2004) Container terminal operation and operations research-A classification and literature review. OR Spectrum 26(1): 3-49.
27. UNCTAD (2009) Review of maritime transport. United Nations conference on trade and development, http://www.unctad.org.
28. Vacca I (2011) Container terminal management: Integrated models and large-scale optimization algorithms. Ph.D. thesis, Ecole Polytechnique Fédérale de Lausanne.
29. Vacca I, Bierlaire M, Salani M (2007) Optimization at container terminals: Status, trends and perspectives. Proc. 7th Swiss Transport Res. Conf. (STRC), http://www.strc.ch/conferences/2007/2007-vacca.pdf.
30. Vacca I, Salani M, Bierlaire M (2010) Optimization of operations in container terminals: Hierarchical vs integrated approaches. Proc. 10th Swiss Transport Res. Conf. (STRC), http://www.strc.ch/conferences/2010/Vacca.pdf.
31. Vis IFA, de Koster R (2003) Transshipment of containers at a container terminal: An overview. Eur. J. Oper. Res. 147(1): 1-16.