A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem

References

• Adulyasak Y, Cordeau J-F, Jans R (2014) Formulations and branch-and-cut algorithms for multi-vehicle production and inventory routing problems. INFORMS J. Comput. 26(1):103–120.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, Bouchard M, Desaulniers G (2011) Enhanced branch-and-price-and-cut for vehicle routing with split deliveries and time windows. Transportation Sci. 45(3):285–298.Link, 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
• 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
• 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
• Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.Link, 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
• Brahimi N, Dauzere-Peres S, Najid NM, Nordli A (2006) Single item lot sizing problems. Eur. J. Oper. Res. 168(1):1–16.Crossref, Google Scholar
• Coelho LC, Laporte G (2013a) The exact solution of several classes of inventory-routing problems. Comput. Oper. Res. 40(2):558–565.Crossref, Google Scholar
• Coelho LC, Laporte G (2013b) A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Internat. J. Production Res. 51(23–24):7156–7169.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 (2012a) The inventory-routing problem with transshipment. Comput. Oper. Res. 39(11):2537–2548.Crossref, Google Scholar
• Coelho LC, Cordeau J-F, Laporte G (2012b) Consistency in multi-vehicle inventory-routing. Transportation Res. Part C: Emerging Tech. 24(1):270–287.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 (2010) Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows. Oper. Res. 58(1):179–192.Link, Google Scholar
• Desaulniers G, Desrosiers J, Solomon MM (2005) Column Generation (Springer, New York).Crossref, Google Scholar
• Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, generalized k-path inequalities, and partial elementarity for the vehicle routing problem with time windows. Transportation Sci. 42(3):387–404.Link, Google Scholar
• Desaulniers G, Madsen OBG, Røpke S (2014) Vehicle routing problems with time windows. Toth P, Vigo D, eds. Vehicle routing: Problems, Methods, and Applications, MOS-SIAM Series on Optimization (SIAM, Philadelphia), 119–159.Crossref, Google Scholar
• Dror M, Ball MO, Golden BL (1985) A computational comparison of algorithms for the inventory routing problem. Ann. Oper. Res. 4(1):3–23.Crossref, Google Scholar
• Engineer FG, Furman KC, Nemhauser GL, Savelsbergh MWP, Song J-H (2012) A branch-and-price-and-cut algorithm for single-product maritime inventory routing. Oper. Res. 60(1):106–122.Link, Google Scholar
• 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.Link, Google Scholar
• Hewitt M, Nemhauser GL, Savelsbergh MWP, Song J-H (2013) A branch-and-price guided search approach to maritime inventory routing. Comput. Oper. Res. 40(5):1410–1419.Crossref, Google Scholar
• Krarup J, Bilde O (1977) Plant location, set covering, and economic lot size: An O(mn)-algorithm for structured problems. Collatz L, Meinardus G, Wetterling W, eds. Numerische Methoden bei Optimierungsverfahren, Band 3, Internat. Series Numerical Math., Vol. 36 (Birkhäuser Verlag, Basel, Switzerland), 155–180.Crossref, Google Scholar
• Laporte G, Nobert Y, Desrochers M (1985) Optimal routing under capacity and distance restrictions. Oper. Res. 33(5):1050–1073.Link, Google Scholar
• Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.Link, 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
• 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.Crossref, 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