A Matheuristic for the Multivehicle Inventory Routing Problem

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
• 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
• Archetti C, Bianchessi N, Irnich S, Speranza MG (2014) Formulations for an inventory routing problem. Internat. Trans. Oper. Res. 21(3):353–374.Crossref, Google Scholar
• Archetti C, Speranza MG, Savelsbergh MWP (2008) An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. 42(1):22–31.Link, Google Scholar
• Bertazzi L, Speranza MG (2012) Inventory routing problems: An introduction. EURO J. Transportation Logist. 1(4):307–326.Crossref, Google Scholar
• Bertazzi L, Speranza MG (2013) Inventory routing problems with multiple customers. EURO J. Transportation Logist. 2(3):255–275.Crossref, 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(1):391–397.Crossref, Google Scholar
• Coelho LC, Cordeau J-F, Laporte G (2012a) Consistency in multi-vehicle inventory-routing. Transportation Res. Part C 24(1):270–287.Crossref, Google Scholar
• Coelho LC, Cordeau J-F, Laporte G (2012b) The inventory-routing problem with transshipment. Comput. Oper. Res. 39(11):2537–2548.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
• Cordeau J-F, Laganà D, Musmanno R, Vocaturo F (2015) A decomposition-based heuristic for the multiple-product inventory-routing problem. Comput. Oper. Res. 55:153–166.Crossref, Google Scholar
• Degraeve Z, Gochet W, Jans R (2002) Alternative formulations for a layout problem in the fashion industry. Eur. J. Oper. Res. 143(1):80–93.Crossref, 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
• Jans R (2009) Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. INFORMS J. Comput. 21(1):123–136.Link, Google Scholar
• Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2):498–516.Link, Google Scholar
• Padberg M, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1):60–100.Crossref, Google Scholar
• Sherali HD, Smith JC (2001) Improving discrete model representations via symmetry considerations. Management Sci. 47(10):1396–1407.Link, 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