Exact Method for Production Hub Location

References

• Absi N , Archetti C , Dauzère-Pérès S , Feillet D (2015) A two-phase iterative heuristic approach for the production routing problem. Transportation Sci. 49(4):784–795.Link, Google Scholar
• Adulyasak Y , Cordeau JF , Jans R (2014a) Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS J. Comput. 26(1):103–120.Link, Google Scholar
• Adulyasak Y , Cordeau JF , Jans R (2014b) Optimization-based adaptive large neighborhood search for the production routing problem. Transportation Sci. 48(1):20–45.Link, Google Scholar
• Adulyasak Y , Cordeau JF , Jans R (2015a) Benders decomposition for production routing under demand uncertainty. Oper. Res. 63(4):851–867.Link, Google Scholar
• Adulyasak Y , Cordeau JF , Jans R (2015b) The production routing problem: A review of formulations and solution algorithms. Comput. Oper. Res. 55(March):141–152.Crossref, Google Scholar
• Akartunalı K , Fragkos I , Miller AJ , Wu T (2016) Local cuts and two-period convex hull closures for big-bucket lot-sizing problems. INFORMS J. Comput. 28(4):766–780.Link, Google Scholar
• Alumur SA , Nickel S , Saldanha da Gama F (2012) Hub location under uncertainty. Transportation Res. Part B: Methodological 46(4):529–543.Crossref, Google Scholar
• Armentano VA , Shiguemoto AL , Løkketangen A (2011) Tabu search with path relinking for an integrated production-distribution problem. Comput. Oper. Res. 38(8):1199–1209.Crossref, Google Scholar
• Birge JR , Louveaux FV (1988) A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34(3):384–392.Crossref, Google Scholar
• Blanco V , Elena F , Hinojosa Y (2023) Hub location with protection under interhub link failures. INFORMS J. Comput. 35(5):966–985.Link, Google Scholar
• Boland N , Krishnamoorthy M , Ernst AT , Ebery J (2004) Preprocessing and cutting for multiple allocation hub location problems. Eur. J. Oper. Res. 155(3):638–653.Crossref, Google Scholar
• Boudia M , Prins C (2009) A memetic algorithm with dynamic population management for an integrated production-distribution problem. Eur. J. Oper. Res. 195(3):703–715.Crossref, Google Scholar
• Boudia M , Louly MAO , Prins C (2007) A reactive GRASP and path relinking for a combined production-distribution problem. Comput. Oper. Res. 34(11):3402–3419.Crossref, Google Scholar
• Campbell JF , O’Kelly ME (2012) Twenty-five years of hub location research. Transportation Sci. 46(2):153–169.Link, Google Scholar
• Chand S , Hsu VN , Sethi S , Deshpande V (2007) A dynamic lot sizing problem with multiple customers: Customer-specific shipping and backlogging costs. IIE Trans. 39(11):1059–1069.Crossref, Google Scholar
• Chandra P , Fisher ML (1994) Coordination of production and distribution planning. Eur. J. Oper. Res. 72(3):503–517.Crossref, Google Scholar
• Chitsaz M , Cordeau JF , Jans R (2019) A unified decomposition matheuristic for assembly, production, and inventory routing. INFORMS J. Comput. 31(1):134–152.Link, Google Scholar
• Contreras I , Fernández E (2014) Hub location as the minimization of a supermodular set function. Oper. Res. 62(3):557–570.Link, Google Scholar
• Contreras I , Cordeau JF , Laporte G (2011a) Benders decomposition for large-scale uncapacitated hub location. Oper. Res. 59(6):1477–1490.Link, Google Scholar
• Contreras I , Díaz JA , Fernández E (2011b) Branch and price for large-scale capacitated hub location problems with single assignment. INFORMS J. Comput. 23(1):41–55.Link, Google Scholar
• Darvish M , Coelho LC (2018) Sequential vs. integrated optimization: Production, location, inventory control, and distribution. Eur. J. Oper. Res. 268(1):203–214.Crossref, Google Scholar
• Darvish M , Larrain H , Coelho LC (2016) A dynamic multi-plant lot-sizing and distribution problem. Internat. J. Production Res. 54(22):6707–6717.Crossref, Google Scholar
• de Camargo RS , de Miranda G Jr , Luna HPL (2009) Benders decomposition for hub location problems with economies of scale. Transportation Sci. 43(1):86–97.Link, Google Scholar
• Elhedhli S , Wu H (2010) A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion. INFORMS J. Comput. 22(2):282–296.Link, Google Scholar
• Ernst AT , Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4(3):139–154.Crossref, Google Scholar
• Evans JR (1985) An efficient implementation of the Wagner–Whitin algorithm for dynamic lot-sizing. J. Oper. Management 5(2):229–235.Crossref, Google Scholar
• Fumero F , Vercellis C (1999) Synchronized development of production, inventory, and distribution schedules. Transportation Sci. 33(3):330–340.Link, Google Scholar
• Gelareh S , Monemi RN , Nickel S (2015) Multi-period hub location problems in transportation. Transportation Res. Part E: Logist. Transportation Rev. 75(March):67–94.Crossref, Google Scholar
• Gopalakrishnan M , Ding K , Bourjolly JM , Mohan S (2001) A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Management Sci. 47(6):851–863.Link, Google Scholar
• Hamacher HW , Labbé M , Nickel M , Sonneborn T (2004) Adapting polyhedral properties from facility to hub location problems. Discrete Appl. Math. 145(1):104–116.Crossref, Google Scholar
• He Y , Wu T , Zhang C , Liang Z (2015) An improved MIP heuristic for the intermodal hub location problem. Omega 57(December):203–211.Crossref, Google Scholar
• Jaruphongsa W , Lee CY (2008) Dynamic lot-sizing problem with demand time windows and container-based transportation cost. Optim. Lett. 2(1):39–51.Crossref, Google Scholar
• Jaruphongsa W , Etinkaya SÇ , Lee CY (2007) Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions. Oper. Res. Lett. 35(6):813–822.Crossref, Google Scholar
• Lee WS , Han JH , Cho SJ (2005) A heuristic algorithm for a multi-product dynamic lot-sizing and shipping problem. Internat. J. Production Econom. 98(2):204–214.Crossref, Google Scholar
• Lei L , Liu S , Ruszczynski A , Park S (2006) On the integrated production, inventory, and distribution routing problem. IIE Trans. 38(11):955–970.Crossref, Google Scholar
• Li CL , Hsu VN , Xiao WQ (2004) Dynamic lot sizing with batch ordering and truckload discounts. Oper. Res. 52(4):639–654.Link, Google Scholar
• Liang Z , He Y , Wu T , Zhang C (2015) An informative column generation and decomposition method for a production planning and facility location problem. Internat. J. Production Econom. 170(Part A):88–96.Crossref, Google Scholar
• Magnanti TL , Wong RT (1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29(3):464–484.Link, Google Scholar
• Manne AS (1958) Programming of economic lot sizes. Management Sci. 4(2):115–135.Link, Google Scholar
• Marín A , Cánovas L , Landete M (2006) New formulations for the uncapacitated multiple allocation hub location problem. Eur. J. Oper. Res. 172(1):274–292.Crossref, Google Scholar
• Miranda PL , Cordeau JF , Ferreira D , Jans R , Morabito R (2018) A decomposition heuristic for a rich production routing problem. Comput. Oper. Res. 98(October):211–230.Crossref, Google Scholar
• Najy W , Diabat A (2020) Benders decomposition for multiple-allocation hub-and-spoke network design with economies of scale and node congestion. Transportation Res. Part B: Methodological 133(March):62–84.Crossref, Google Scholar
• Oliveira FA , de Sá EM , de Souza SR (2022) Benders decomposition applied to profit maximizing hub location problem with incomplete hub network. Comput. Oper. Res. 142(June):105715.Crossref, Google Scholar
• Rizk N , Martel A , Ramudhin A (2006) A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs. Internat. J. Production Econom. 102(2):344–357.Crossref, Google Scholar
• Romeijn HE , Sharkey TC , Shen ZM , Zhang J (2010) Integrating facility location and production planning decisions. Networks 55(2):78–89.Crossref, Google Scholar
• Ruokokoski M , Solyali OGUZ , Cordeau JF , Jans R (2010) Efficient formulations and a branch-and-cut algorithm for a production-routing problem. Les Cahiers du GERAD G-2010-66, HEC Montréal, Montréal.Google Scholar
• Sharkey TC , Geunes J , Romeijn HE , Shen ZM (2011) Exact algorithms for integrated facility location and production planning problems. Naval Res. Logist. 58(5):419–436.Crossref, Google Scholar
• Shen H , Liang Y , Shen ZJM (2021) Reliable hub location model for air transportation networks under random disruptions. Manufacturing Service Oper. Management 23(2):388–406.Abstract, Google Scholar
• Stadtler H (2003) Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res. 51(3):487–502.Link, Google Scholar
• Sun Z , Zheng J (2016) Finding potential hub locations for liner shipping. Transportation Res. Part B: Methodological 93(November):750–761.Crossref, Google Scholar
• Taherkhani G , Alumur SA , Hosseini M (2020) Benders decomposition for the profit maximizing capacitated hub location problem with multiple demand classes. Transportation Sci. 54(6):1446–1470.Link, Google Scholar
• Tan PZ , Kara BY (2007) A hub covering model for cargo delivery systems. Networks 49(1):28–39.Crossref, Google Scholar
• Trigeiro W , Thomas LJ , John OM (1989) Capacitated lot sizing with setup times. Management Sci. 35(3):353–366.Link, Google Scholar
• Wagner HM , Whitin TM (1958) Dynamic version of the economic lot size model. Management Sci. 5(1):89–96.Link, Google Scholar
• Wandelt S , Weibin D , Jun Z , Xiaoqian S (2022) Toward a reference experimental benchmark for solving hub location problems. Transportation Sci. 56(2):543–564.Link, Google Scholar
• Wu T , Liang Z , Zhang C (2018) Analytics branching and selection for the capacitated multi-item lot sizing problem with non-identical machines. INFORMS J. Comput. 30(2):236–258.Link, Google Scholar
• Wu T , Shi Z , Zhang C (2020a) The hub location problem with market selection. Comput. Oper. Res. 127(March):105136.Google Scholar
• Wu T , Shi L , Akartunalı K , Geunes J (2011) An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. Eur. J. Oper. Res. 214(2):428–441.Crossref, Google Scholar
• Wu T , Huang L , Liang Z , Zhang X , Zhang C (2022) A supervised learning-driven heuristic for solving the facility location and production planning problem. Eur. J. Oper. Res. 301(2):785–796.Crossref, Google Scholar
• Wu T , Shi Z , Liang Z , Zhang X , Zhang C (2020b) Dantzig-Wolfe decomposition for the facility location and production planning problem. Comput. Oper. Res. 124(December):105068.Crossref, Google Scholar
• Zhang Z , Luo Z , Baldacci R , Lim A (2021) A Benders decomposition approach for the multivehicle production routing problem with order-up-to-level policy. Transportation Sci. 55(1):160–178.Link, Google Scholar
• Zhang C , Xie F , Huang K , Wu T , Liang Z (2017) MIP models and a hybrid method for the capacitated air-cargo network planning and scheduling problems. Transportation Res. Part E: Logist. Transportation Rev. 103(July):158–173.Crossref, Google Scholar
• Zhao M , Zhang M (2020) Multiechelon lot sizing: New complexities and inequalities. Oper. Res. 68(2):534–551.Abstract, Google Scholar