A two-stage robust optimization approach for the berth allocation problem under uncertainty
Tóm tắt
This paper examines the berth allocation problem under uncertainty. We use uncertainty sets to describe the possible scenarios without depending on probabilistic information. Then we adopt a two-stage robust optimization approach where baseline schedule is made before and the recovery operation is made after the disruptions are known. Three two-stage robust models are constructed to generate less conservative solutions. Experimental results demonstrate that the schedule’s robustness can be improved with only a slight increase in the baseline cost. Finally, some management insights are presented based on the numerical results.
Tài liệu tham khảo
Agra A, Oliveira M (2018) MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem. Eur J Oper Res 264(1):138–148
An Y, Zeng B (2015) Exploring the modeling capacity of two-stage robust optimization: variants of robust unit commitment model. IEEE Trans Power Syst 30(1):109–122
An Y, Zeng B, Zhang Y, Zhao L (2014) Reliable p-median facility location problem: two-stage robust models and algorithms. Transp Res Part B Methodol 64(1):54–72
Atamtrk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Oper Res 55(4):662–673
Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464–501
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
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
Cordeau JF, Laporte G, Legato P, Moccia L (2005) Models and tabu search heuristics for the berth-allocation problem. Transp Sci 39(4):526–538
Gabrel V, Murat C, Thiele A (2014) Recent advances in robust optimization: an overview. Eur J Oper Res 235(3):471–483
Giallombardo G, Moccia L, Salani M, Vacca I (2010) Modeling and solving the tactical berth allocation problem. Transp Res Part B Methodol 44(2):232–245
Golias MM (2011) A bi-objective berth allocation formulation to account for vessel handling time uncertainty. Marit Econ Logist 13(4):419–441
Golias M, Portal I, Konur D, Kaisar E, Kolomvos G (2014) Robust berth scheduling at marine container terminals via hierarchical optimization. Comput Oper Res 41(1):412–422
Guan Y, Cheung RK (2004) The berth allocation problem: models and solution methods. OR Spectr 26(1):75–92
Han XL, Lu ZQ, Xi LF (2010) A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. Eur J Oper Res 207(3):1327–1340
Hansen P, Oguzb C, Mladenovic N (2008) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res 191(3):636–649
Hendriks M, Laumanns M, Lefeber E, Udding JT (2010) Robust cyclic berth planning of container vessels. OR Spectr 32(3):501–517
Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transp Res Part B Methodol 35(4):401–417
Imai A, Nishimura E, Papadimitriou S (2003) Berth allocation with service priority. Transp Res Part B Methodol 37(5):437–457
Imai A, Sun X, Nishimura E, Papadimitriou S (2005) Berth allocation in a container port: using a continuous location space approach. Transp Res Part B 39(3):199–221
Imai A, Chen HC, Nishimura E, Papadimitriou S (2008) The simultaneous berth and quay crane allocation problem. Transp Res Part E Logist Transp Rev 44(5):900–920
Karafa J, Golias MM, Ivey S, Saharidis DGK (2013) The berth allocation problem with stochastic vessel handling times. Int J Adv Manuf Technol 65(1–4):473–484
Kim KH, Chan K (2003) Berth scheduling by simulated annealing. Transp Res Part B 37(6):541–560
Lalla-Ruiz E, Moreno-Vega JM (2012) Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem. Pergamon Press, Inc., New York
Lalla-Ruiz E, Moreno-Vega JM (2014) Biased random key genetic algorithm for the tactical berth allocation problem. Appl Soft Comput J 22(6):60–76
Li MZ, Jin JG, Lu CX (2015) Real-time disruption recovery for integrated berth allocation and crane assignment in container terminals. Transp Res Rec J Transp Res Board 2479(2479):49–59
Liu C, Xiang X, Zhang C, Zheng L (2016a) A decision model for berth allocation under uncertainty considering service level using an adaptive differential evolution algorithm. Asia Pac J Oper Res 33(06):615–627
Liu C, Zheng L, Zhang C (2016b) Behavior perception-based disruption models for berth allocation and quay crane assignment problems. Comput Ind Eng 97:258–275
Liu C, Xiang X, Li Z (2017) Two decision models for berth allocation problem under uncertainty considering service level. Flex Serv Manuf J 3:1–33
Meisel F, Bierwirth C (2009) Heuristics for the integration of crane productivity in the berth allocation problem. Transp Res Part E Log Transp Rev 45(1):196–209
Monaco MF, Sammarra M (2007) The berth allocation problem: a strong formulation solved by a Lagrangean approach. Transp Sci 41(2):265–280
Moorthy R, Teo CP (2006) Berth management in container terminal: the template design problem. OR Spectr 28(4):495–518
Nishimura E, Imai A, Papadimitriou S (2001) Berth allocation planning in the public berth system by genetic algorithms. Eur J Oper Res 131(2):282–292
Park YM, Kim KH (2003) A scheduling method for berth and quay cranes. OR Spectr 25(1):1–23
Parvaresh F, Husseini SMM, Golpayegany SAH, Karimi B (2014) Hub network design problem in the presence of disruptions. J Intell Manuf 25(4):755–774
Pishvaee MS, Rabbani M, Torabi SA (2011) A robust optimization approach to closed-loop supply chain network design under uncertainty. Appl Math Model 35(2):637–649
Schepler X, Balev S, Michel S, Sanlaville E (2017) Global planning in a multi-terminal and multi-modal maritime container port. Transp Res Part E Logist Transp Rev 100:38–62
Shang C, You F (2018) Distributionally robust optimization for planning and scheduling under uncertainty. Comput Chem Eng 110:53–68
Snyder LV, Atan Z, Peng P, Rong Y, Schmitt AJ, Sinsoysal B (2010) OR/MS models for supply chain disruptions: a review. IIE Trans 48(2):89–109
Stahlbock R, Vo S (2008) Operations research at container terminals: a literature update. OR Spectr 30(1):1–52
Steenken D, Vo S, Stahlbock R (2004) Container terminal operation and operations research—a classification and literature review. OR Spectr 26(1):3–49
Umang N, Bierlaire M, Vacca I (2013) Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transp Res Part E Logist Transp Rev 54(7):14–31
Ursavas E, Zhu SX (2016) Optimal policies for the berth allocation problem under stochastic nature. Eur J Oper Res 255(2):380–387
Vis IFA, Koster RD (2003) Transshipment of containers at a container terminal: an overview. Eur J Oper Res 147(1):1–16
Xiang X, Liu C, Miao L (2017) A bi-objective robust model for berth allocation scheduling under uncertainty. Transp Res Part E Logist Transp Rev 106:294–319
Xiang X, Liu C, Miao L (2018) Reactive strategy for discrete berth allocation and quay crane assignment problems under uncertainty. Comput Ind Eng 126:196–216
Xu Y, Chen Q, Quan X (2012) Robust berth scheduling with uncertain vessel delay and handling time. Ann Oper Res 192(1):123–140
Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper Res Lett 41(5):457–461
Zhang Y, Shen ZJM, Song S (2016) Distributionally robust optimization of two-stage lot-sizing problems. Prod Oper Manag 25(12):2116–2131
Zhen L (2015) Tactical berth allocation under uncertainty. Eur J Oper Res 247(3):928–944
Zhen L, Chang DF (2012) A bi-objective model for robust berth allocation scheduling. Comput Ind Eng 63(1):262–273
Zhen L, Lee LH, Chew EP (2011) A decision model for berth allocation under uncertainty. Eur J Oper Res 212(1):54–68