A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy

References

• Adulyasak Y, Cordeau J-F, 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 J-F, 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 J-F, Jans R (2015) The production routing problem: A review of formulations and solution algorithms. Comput. Oper. Res. 55:141–152.Crossref, Google Scholar
• Andersson H, Hoff A, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: Combined inventory management and routing. Comput. Oper. Res. 37(9):1515–1536.Crossref, Google Scholar
• Archetti C, Bertazzi L, Hertz A, Speranza MG (2012) A hybrid heuristic for an inventory routing problem. INFORMS J. Comput. 24(1):101–116.Link, Google Scholar
• Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Sci. 41(3):382–391.Link, Google Scholar
• Archetti C, Bertazzi L, Paletta G, Speranza MG (2011) Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 38(12):1731–1746.Crossref, Google Scholar
• Avella P, Boccia M, Wolsey LA (2015) Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances. Networks 65(2):129–138.Crossref, Google Scholar
• Avella P, Boccia M, Wolsey LA (2018) Single-period cutting planes for inventory routing problems. Transportation Sci. 52(3):497–508.Link, Google Scholar
• Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming 115(2):351–385.Crossref, Google Scholar
• Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.Link, Google Scholar
• Baldacci R, Bartolini E, Mingozzi A, Roberti R (2010) An exact solution framework for a broad class of vehicle routing problems. Comput. Management Sci. 7(3):229–268.Crossref, Google Scholar
• Bard JF, Nananukul N (2010) A branch-and-price algorithm for an integrated production and inventory routing problem. Comput. Oper. Res. 37(12):2202–2217.Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerical Math. 4(1):238–252.Crossref, Google Scholar
• Bertazzi L, Paletta G, Speranza MG (2002) Deterministic order-up-to level policies in an inventory routing problem. Transportation Sci. 36(1):119–132.Link, Google Scholar
• Bertazzi L, Savelsbergh M, Speranza MG (2008) Inventory routing. Golden B, Raghavan S, Wasil E, eds. Operations Research/Computer Science Interfaces (Springer, New York), 49–72.Crossref, Google Scholar
• Campbell AM, Clarke LW, Savelsbergh MWP (2002) Inventory routing in practice. Toth P, Vigo D, eds. The Vehicle Routing Problem (SIAM, Philadelphia), 309–330.Google Scholar
• Codato G, Fischetti M (2006) Combinatorial benders’ cuts for mixed-integer linear programming. Oper. Res. 54(4):756–766.Link, Google Scholar
• Coelho LC, Laporte G (2013) The exact solution of several classes of inventory-routing problems. Comput. Oper. Res. 40(2):558–565.Crossref, Google Scholar
• Coelho LC, Laporte G (2014) Improved solutions for inventory-routing problems through valid inequalities and input ordering. Internat. J. Production Econom. 155:391–397.Crossref, Google Scholar
• Coelho LC, Cordeau J-F, Laporte G (2014) Thirty years of inventory routing. Transportation Sci. 48(1):1–19.Link, Google Scholar
• Desaulniers G, Rakke JG, Coelho LC (2016) A branch-price-and-cut algorithm for the inventory-routing problem. Transportation Sci. 50(3):1060–1076.Link, Google Scholar
• Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Management Sci. 40(10):1276–1290.Link, Google Scholar
• Geoffrion AM (1972) Generalized benders decomposition. J. Optim. Theory Appl. 10(4):237–260.Crossref, Google Scholar
• Hooker JN (2000) Logic-Based Methods for Optimization (John Wiley & Sons, New York).Crossref, Google Scholar
• Hooker JN (2007) Planning and scheduling by logic-based benders decomposition. Oper. Res. 55(3):588–602.Link, Google Scholar
• Hooker JN, Ottosson G (2003) Logic-based benders decomposition. Math. Programming 96(1):33–60.Crossref, Google Scholar
• IBM CPLEX (2016) IBM ILOG CPLEX 12.6.3 callable library.Google Scholar
• Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100(2):423–445.Crossref, Google Scholar
• Pessoa A, de Aragão MP, Uchoa E (2008) Robust branch-cut-and-price algorithms for vehicle routing problems. Golden BL, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, New York), 297–325.Google Scholar
• Pessoa A, Uchoa E, Poggi de Aragão M (2009) A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks 54(4):167–177.Crossref, Google Scholar
• Poggi M, Uchoa E (2014) New exact algorithms for the capacitated vehicle routing problem. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications, 2nd ed., MOS-SIAM Series on Optimization (SIAM, Philadelphia), 59–86.Google Scholar
• Solyalı O, Süral H (2011) A branch-and-cut algorithm using a strong formulation and an a priori tour-based heuristic for an inventory-routing problem. Transportation Sci. 45(3):335–345.Link, Google Scholar
• Solyalı O, Cordeau J-F, Laporte G (2012) Robust inventory routing under demand uncertainty. Transportation Sci. 46(3):327–340.Link, Google Scholar
• Toth P, Vigo D (2014) Vehicle Routing: Problems, Methods, and Applications, 2nd ed., MOS-SIAM Series on Optimization (SIAM, Philadelphia).Crossref, Google Scholar
• Zhang Z, Luo Z, Qin H, Lim A (2019) Exact algorithms for the vehicle routing problem with time windows and combinatorial auction. Transportation Sci. 53(2):427–441.Google Scholar