A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems

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 (2015) The production routing problem: A review of formulations and solution algorithms. Comput. Oper. Res. 55:141–152.Crossref, Google Scholar
• Alvarez A, Munari P, Morabito R (2018) Iterated local search and simulated annealing algorithms for the inventory routing problem. Internat. Trans. Oper. Res. 25(6):1785–1809.Crossref, Google Scholar
• Alvarez A, Cordeau JF, Jans R, Munari P, Morabito R (2020) Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products. Eur. J. Oper. Res. 283(2):511–529.Crossref, Google Scholar
• Andersson H, Hoff A, Christiansen M, Hasle G, Løketangen A (2010) Industrial aspects and literature survey: Combined inventory management and routing. Comput. Oper. Res. 37(9):1515–1536.Crossref, Google Scholar
• Aráoz J, Fernández E, Meza O (2009) Solving the prize-collecting rural postman problem. Eur. J. Oper. Res. 196(3):886–896.Crossref, Google Scholar
• Archetti A, 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, Boland N, Speranza MG (2017) A matheuristic for the multivehicle inventory routing problem. INFORMS J. Comput. 29(3):377–387.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, Guastaroba G, Huerta-Muñoz DL, Speranza MG (2021) A kernel search heuristic for the multivehicle inventory routing problem. Internat. Trans. Oper. Res. 28(6):2984–3013.Crossref, Google Scholar
• Augerat P, Belenguer J, Benavent E, Corberán A, Naddef D (1998) Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. 106(2):546–557.Crossref, Google Scholar
• Avci M, Yildiz ST (2019) A matheuristic solution approach for the production routing problem with visit spacing policy. Eur. J. Oper. Res. 279(2):572–588.Crossref, Google Scholar
• Avella P, Boccia M, Wolsey LA (2015) Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instance. 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
• Barahona F, Grötschel M (1986) On the cycle polytope of a binary matroid. J. Combin. Theory Ser. B 40(1):40–62.Crossref, Google Scholar
• Bell WJ, Dalberto LM, Fisher ML, Greenfield A, Jaikumar R, Kedia P, Mack RG, Prutzman PJ (1983) Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13(6):4–23.Link, Google Scholar
• Bertazzi L, Coelho LC, De Maio A, Laganà D (2019) A matheuristic algorithm for the multi-depot inventory routing problem. Transportation Res. Part E Logist. Transportation Rev. 122:524–544.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
• 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
• 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, Laporte G (2015) An optimised target-level inventory replenishment policy for vendor-managed inventory systems. Internat. J. Production Res. 53(12):3651–3660.Crossref, Google Scholar
• Coelho LC, Cordeau JF, Laporte G (2012) Consistency in multi-vehicle inventory-routing. Transportation Res. Part C Emerging Tech. 24:270–287.Crossref, Google Scholar
• Coelho LC, Cordeau JF, Laporte G (2014) Thirty years of inventory routing. Transportation Sci. 48(1):1–19.Link, Google Scholar
• Desaulniers G, Rakke JG, Coelho LC (2015) A branch-price-and-cut algorithm for the inventory-routing problem. Transportation Sci. 50(3):1060–1076.Link, Google Scholar
• Diniz P, Martinelli R, Poggi M (2020) An efficient matheuristic for the inventory routing problem. Baïou M, Gendron B, Günlük O, Mahjoub AR, eds. Combinatorial Optimization (Springer International Publishing, Cham, Switzerland), 273–285.Crossref, Google Scholar
• Eager DL, Zahorjan J, Lazowska ED (1989) Speedup vs. efficiency in parallel systems. IEEE Trans. Comput. 38(3):408–423.Crossref, Google Scholar
• Guimarães TA, Schenekemberg CM, Coelho LC, Scarpin CT, Pécora-Jr JE (2023) Mechanisms for feasibility and improvement for inventory-routing problems. J. Oper. Res. Soc. Forthcoming. https://doi.org/1080/01605682.2023.2174052.Crossref, Google Scholar
• Li Y, Chu F, Chu C, Zhu Z (2019) An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing. Eur. J. Oper. Res. 272(3):914–927.Crossref, Google Scholar
• Manousakis E, Repoussis P, Zachariadis E, Tarantilis C (2021) Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation. Eur. J. Oper. Res. 290(3):870–885.Crossref, Google Scholar
• Manousakis EG, Kasapidis GA, Kiranoudis CT, Zachariadis EE (2022) An infeasible space exploring matheuristic for the production routing problem. Eur. J. Oper. Res. 298(2):478–495.Crossref, 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
• Qiu Y, Wang L, Xu X, Fang X, Pardalos PM (2018) A variable neighborhood search heuristic algorithm for production routing problems. Appl. Soft Comput. 66:311–318.Crossref, Google Scholar
• Russell RA (2017) Mathematical programming heuristics for the production routing problem. Internat. J. Production Econom. 193:40–49.Crossref, Google Scholar
• Schenekemberg CM, Scarpin CT, Pécora JE Jr, Guimarães TA, Coelho LC (2020) The two-echelon inventory-routing problem with fleet management. Comput. Oper. Res. 121:104944.Crossref, Google Scholar
• Schenekemberg CM, Scarpin CT, Pécora JE Jr, Guimarães TA, Coelho LC (2021) The two-echelon production-routing problem. Eur. J. Oper. Res. 288(2):436–449.Crossref, Google Scholar
• Skålnes J, Andersson H, Desaulniers G, Stålhane M (2022) An improved formulation for the inventory routing problem with time-varying demands. Eur. J. Oper. Res. 302(3):1189–1201.Crossref, Google Scholar
• Solyalı O, Süral H (2017) A multi-phase heuristic for the production routing problem. Comput. Oper. Res. 87:114–124.Crossref, Google Scholar
• Solyalı O, Süral H (2022) An effective matheuristic for the multivehicle inventory routing problem. Transportation Sci. 56(4):1044–1057.Link, Google Scholar
• Vadseth ST, Andersson H, Stålhane M (2021) An iterative matheuristic for the inventory routing problem. Comput. Oper. Res. 131:105262.Crossref, Google Scholar
• Vadseth ST, Andersson H, Stålhane M, Chitsaz M (2023) A multi-start route improving matheuristic for the production routing problem. Internat. J. Production Res. Forthcoming. https://doi.org/10.1080/00207543.2022.2154402.Crossref, Google Scholar
• Vidal T (2022) Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood. Comput. Oper. Res. 140:105643.Crossref, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3):611–624.Link, 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