Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem

References

• Addis B, Carello G, Ceselli A (2012) Exactly solving a two-level location problem with modular node capacities. Networks 59(1):161–180.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Bierwirth C, Meisel F (2015) A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 244(3):675–689.Crossref, Google Scholar
• Brouer BD, Alvarez JF, Plum CE, Pisinger D, Sigurd MM (2013) A base integer programming model and benchmark suite for liner-shipping network design. Transportation Sci. 48(2):281–312.Link, Google Scholar
• Cordeau JF, Gaudioso M, Laporte G, Moccia L (2007) The service allocation problem at the Gioia Tauro maritime terminal. Eur. J. Oper. Res. 176(2):1167–1184.Crossref, Google Scholar
• 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.Link, Google Scholar
• Du Y, Chen Q, Lam JSL, Xu Y, Cao JX (2015) Modeling the impacts of tides and the virtual arrival policy in berth allocation. Transportation Sci. 49(4):939–956.Link, Google Scholar
• Du Y, Chen Q, Quan X, Long L, Fung RY (2011) Berth allocation considering fuel consumption and vessel emissions. Transportation Res. Part E: Logist. Transportation Rev. 47(6):1021–1037.Crossref, Google Scholar
• Expósito-Izquierdo C, Lalla-Ruiz E, Lamata T, Melián-Batista B, Moreno-Vega JM (2016) Fuzzy optimization models for seaside port logistics: Berthing and quay crane scheduling. Comput. Intelligence 613:323–343.Crossref, Google Scholar
• Fransoo JC, Lee CY (2013) The critical role of ocean container transport in global supply chain performance. Production Oper. Management 22(2):253–268.Crossref, Google Scholar
• Gharehgozli AH, Roy D, de Koster R (2016) Sea container terminals: New technologies and or models. Maritime Econom. Logist. 18(2):103–140.Crossref, Google Scholar
• Gharehgozli AH, Laporte G, Yu Y, de Koster R (2015) Scheduling twin yard cranes in a container block. Transportation Sci. 49(3):686–705.Link, Google Scholar
• Gharehgozli AH, Yu Y, de Koster R, Udding JT (2014) An exact method for scheduling a yard crane. Eur. J. Oper. Res. 235(2):431–447.Crossref, Google Scholar
• Giallombardo G, Moccia L, Salani M, Vacca I (2010) Modeling and solving the tactical berth allocation problem. Transportation Res. Part B: Methodological 44(2):232–245.Crossref, Google Scholar
• Han Y, Lee LH, Chew EP, Tan KC (2008) A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub. OR Spectrum 30(4):697–720.Crossref, Google Scholar
• Hendriks M, Lefeber E, Udding J (2013) Simultaneous berth allocation and yard planning at tactical level. OR Spectrum 35(2):441–456.Crossref, Google Scholar
• Hu QM, Hu ZH, Du Y (2014) Berth and quay-crane allocation problem considering fuel consumption and emissions from vessels. Comput. Indust. Engrg. 70:1–10.Crossref, Google Scholar
• Imai A, Nagaiwa K, Tat CW (1997) Efficient planning of berth allocation for container terminals in Asia. J. Adv. Transportation 31(1):75–94.Crossref, Google Scholar
• Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transportation Res. Part B: Methodological 35(4):401–417.Crossref, Google Scholar
• Imai A, Chen HC, Nishimura E, Papadimitriou S (2008) The simultaneous berth and quay crane allocation problem. Transportation Res. Part E: Logist. Transportation Rev. 44(5):900–920.Crossref, Google Scholar
• Imai A, Sun X, Nishimura E, Papadimitriou S (2005) Berth allocation in a container port: Using a continuous location space approach. Transportation Res. Part B: Methodological 39(3):199–221.Crossref, Google Scholar
• Iris Ç, Pacino D, Ropke S (2017) Improved formulations and an adaptive large neighborhood search heuristic for the integrated berth allocation and quay crane assignment problem. Transportation Res. Part E: Logist. Transportation Rev. 105:123–147.Crossref, Google Scholar
• Iris Ç, Pacino D, Ropke S, Larsen A (2015) Integrated berth allocation and quay crane assignment problem: Set partitioning models and computational results. Transportation Res. Part E: Logist. Transportation Rev. 81:75–97.Crossref, Google Scholar
• Jiang X, Lee LH, Chew EP, Han Y, Tan KC (2012) A container yard storage strategy for improving land utilization and operation efficiency in a transshipment hub port. Eur. J. Oper. Res. 221(1):64–73.Crossref, Google Scholar
• Jiang XJ, Jin JG (2017) A branch-and-price method for integrated yard crane deployment and container allocation in transshipment yards. Transportation Res. Part B: Methodological 98:62–75.Crossref, Google Scholar
• Jin JG, Lee DH, Cao JX (2016) Storage yard management in maritime container terminals. Transportation Sci. 50(4):1300–1313.Link, Google Scholar
• Jin JG, Lee DH, Hu H (2015) Tactical berth and yard template design at container transshipment terminals: A column generation based approach. Transportation Res. Part E: Logist. Transportation Rev. 73:168–184.Crossref, Google Scholar
• Kannoth S (2014) Automated future for ports. Navis. Accessed July 22, 2017, http://navis.com/news/in-news/automated-future-ports.Google Scholar
• Kim KH, Moon KC (2003) Berth scheduling by simulated annealing. Transportation Res. Part B: Methodological 37(6):541–560.Crossref, Google Scholar
• Lalla-Ruiz E, Expósito-Izquierdo C, Melián-Batista B, Moreno-Vega JM (2016) A set-partitioning-based model for the berth allocation problem under time-dependent limitations. Eur. J. Oper. Res. 250(3):1001–1012.Crossref, Google Scholar
• Lalla-Ruiz E, González-Velarde JL, Melián-Batista B, Moreno-Vega JM (2014) Biased random key genetic algorithm for the tactical berth allocation problem. Appl. Soft Comput. 22:60–76.Crossref, Google Scholar
• Lalla-Ruiz E, Izquierdo CE, Batista BM, Moreno-Vega JM (2013) A metaheuristic approach for the seaside operations in maritime container terminals. Rojas I, Joya G, Cabestany J, eds. Adv. Comput. Intelligence, IWANN 2013, Lecture Notes Comput. Sci., Vol. 7903 (Springer, Berlin Heidelberg), 28–35.Google Scholar
• Lalla-Ruiz E, Voß S, Expósito-Izquierdo C, Melián-Batista B, Moreno-Vega JM (2017) A popmusic-based approach for the berth allocation problem under time-dependent limitations. Ann. Oper. Res. 253(2):871–897.Crossref, Google Scholar
• Lee DH, Jin JG (2013) Feeder vessel management at container transshipment terminals. Transportation Res. Part E: Logist. Transportation Rev. 49(1):201–216.Crossref, Google Scholar
• Legato P, Mazza RM (2001) Berth planning and resources optimisation at a container terminal via discrete event simulation. Eur. J. Oper. Res. 133(3):537–547.Crossref, Google Scholar
• Legato P, Mazza RM, Gullì D (2014) Integrating tactical and operational berth allocation decisions via simulation-optimization. Comput. Indust. Engrg. 78:84–94.Crossref, Google Scholar
• Li C, Qi X, Song D (2016) Real-time schedule recovery in liner shipping service with regular uncertainties and disruption events. Transportation Res. Part B: Methodological 93:762–788.Crossref, Google Scholar
• Li F, Sheu JB, Gao ZY (2015) Solving the continuous berth allocation and specific quay crane assignment problems with quay crane coverage range. Transportation Sci. 49(4):968–989.Link, Google Scholar
• Lim A (1998) The berth planning problem. Oper. Res. Lett. 22(2):105–110.Crossref, Google Scholar
• Lim A, Xu Z (2006) A critical-shaking neighborhood search for the yard allocation problem. Eur. J. Oper. Res. 174(2):1247–1259.Crossref, Google Scholar
• Mauri GR, Ribeiro GM, Lorena LAN, Laporte G (2016) An adaptive large neighborhood search for the discrete and continuous berth allocation problem. Comput. Oper. Res. 70:140–154.Crossref, Google Scholar
• Meisel F, Bierwirth C (2009) Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Res. Part E: Logist. Transportation Rev. 45(1):196–209.Crossref, Google Scholar
• Meisel F, Bierwirth C (2013) A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transportation Sci. 47(2):131–147.Link, Google Scholar
• Meng Q, Wang S (2011) Liner shipping service network design with empty container repositioning. Transportation Res. Part E: Logist. Transportation Rev. 47(5):695–708.Crossref, Google Scholar
• Meng Q, Wang S, Andersson H, Thun K (2014) Containership routing and scheduling in liner shipping: Overview and future research directions. Transportation Sci. 48(2):265–280.Link, Google Scholar
• Monaco MF, Sammarra M (2007) The berth allocation problem: A strong formulation solved by a Lagrangean approach. Transportation Sci. 41(2):265–280.Link, Google Scholar
• Moorthy R, Teo CP (2006) Berth management in container terminal: The template design problem. OR Spectrum 28(4):495–518.Crossref, Google Scholar
• Park K, Kim KH (2002) Berth scheduling for container terminals by using a sub-gradient optimization technique. J. Oper. Res. Soc. 53(9):1054–1062.Crossref, Google Scholar
• Park YM, Kim KH (2003) A scheduling method for berth and quay cranes. OR Spectrum 25(1):1–23.Crossref, Google Scholar
• Ribeiro GM, Mauri GR, de Castro Beluco S, Lorena LAN, Laporte G (2016) Berth allocation in an ore terminal with demurrage, despatch and maintenance. Comput. Indust. Engrg. 96:8–15.Crossref, Google Scholar
• Robenek T, Umang N, Bierlaire M, Ropke S (2014) A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports. Eur. J. Oper. Res. 235(2):399–411.Crossref, Google Scholar
• Stahlbock R, Voß S (2008) Operations research at container terminals: A literature update. OR Spectrum 30(1):1–52.Crossref, Google Scholar
• Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research–a classification and literature review. OR Spectrum 26(1):3–49.Crossref, Google Scholar
• Vacca I, Salani M, Bierlaire M (2013) An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Sci. 47(2):148–161.Link, Google Scholar
• Venturini G, Iris Ç, Kontovas CA, Larsen A (2017) The multi-port berth allocation problem with speed optimization and emission considerations. Transportation Res. Part D: Transport Environment 54:142–159.Crossref, Google Scholar
• Vis IFA, de Koster R (2003) Transshipment of containers at a container terminal: An overview. Eur. J. Oper. Res. 147(1):1–16.Crossref, Google Scholar
• Wang Y, Meng Q, Du Y (2015) Liner container seasonal shipping revenue management. Transportation Res. Part B: Methodological 82:141–161.Crossref, Google Scholar
• Won SH, Zhang X, Kim KH (2012) Workload-based yard-planning system in container terminals. J. Intelligent Manufacturing 23(6):2193–2206.Crossref, Google Scholar
• Xu D, Li CL, Leung JYT (2012) Berth allocation with time-dependent physical limitations on vessels. Eur. J. Oper. Res. 216(1):47–56.Crossref, Google Scholar
• Zhen L (2015) Tactical berth allocation under uncertainty. Eur. J. Oper. Res. 247(3):928–944.Crossref, Google Scholar
• Zhen L, Chew EP, Lee LH (2011) An integrated model for berth template and yard template planning in transshipment hubs. Transportation Sci. 45(4):483–504.Link, Google Scholar
• Zhen L, Xu Z, Wang K, Ding Y (2016) Multi-period yard template planning in container terminals. Transportation Res. Part B: Methodological 93:700–719.Crossref, Google Scholar