Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems

References

• Adulyasak Y, Cordeau J-F, Jans R (2012) Optimization-based adaptive large neighborhood search for the production routing problem. Transportation Sci., ePub ahead of print December 13, http://dx.doi.org/10.1287/trsc.1120.0443.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:1515–1536.Crossref, Google Scholar
• Applegate D, Bixby R, Chvátal V, Cook W (2011) Concorde TSP solver. Accessed April 15, 2012, http://www.tsp.gatech.edu/concorde.html.Google Scholar
• Archetti C, Bertazzi L, Hertz A, Speranza MG (2012) A hybrid heuristic for an inventory routing problem. INFORMS J. Comput. 24: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: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:1731–1746.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:2202–2217.Crossref, Google Scholar
• Chandra P, Fisher ML (1994) Coordination of production and distribution planning. Eur. J. Oper. Res. 72:503–517.Crossref, Google Scholar
• Coelho LC, Cordeau J-F, Laporte G (2012) Consistency in multi-vehicle inventory-routing. Transport. Res. C-Emer. 24:270–287.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:80–93.Crossref, Google Scholar
• Fischetti M, Lodi A (2003) Local branching. Math. Programming 98:23–47.Crossref, Google Scholar
• Fumero F, Vercellis C (1999) Synchronized development of production, inventory, and distribution schedules. Transportation Sci. 33:330–340.Link, Google Scholar
• Gendreau M, Hertz A, Laporte G (1992) New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40:1086–1094.Link, Google Scholar
• Jans R (2009) Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. INFORMS J. Comput. 21:123–136.Link, Google Scholar
• Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44:2245–2269.Crossref, Google Scholar
• Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100:423–445.Crossref, Google Scholar
• Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J. Assoc. Comput. Mach. 7:326–329.Crossref, Google Scholar
• Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40:455–472.Link, Google Scholar
• Ruokokoski M, Solyalı O, Cordeau J-F, Jans R, Süral H (2010) Efficient formulations and a branch-and-cut algorithm for a production-routing problem. GERAD Technical Report G-2010-66, HEC Montréal, Canada.Google Scholar
• Sherali HD, Smith JC (2001) Improving discrete model representations via symmetry considerations. Management Sci. 47:1396–1407.Link, Google Scholar
• Solyalı O, Süral H (2009) A relaxation based solution approach for the inventory control and vehicle routing problem in vendor managed systems. Neogy SK, Das SK, Bapat RB, eds. Modeling, Computation and Optimization (World Scientific, Singapore), 171–189.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:335–345.Link, Google Scholar
• Toth P, Vigo D (2002) An overview of vehicle routing problems. Toth P, Vigo D, eds. The Vehicle Routing Problem (SIAM Monographs on Discrete Mathematics and Applications, Philadelphia), 1–26.Crossref, Google Scholar