1,211
Views
3
CrossRef citations to date
0
Altmetric
Research Articles

A multi-start route improving matheuristic for the production routeing problem

ORCID Icon, , &
Pages 7608-7629 | Received 21 Oct 2021, Accepted 15 Nov 2022, Published online: 03 Jan 2023

References

  • Absi, N., C. Archetti, S. Dauzère-Pérès, and D. Feillet. 2015. “A Two-Phase Iterative Heuristic Approach for the Production Routing Problem.” Transportation Science 49: 784–795.
  • Achamrah, F. E., Riane, F., Di Martinelly, C., & Limbourg, S. 2022. “A matheuristic for solving inventory sharing problems.” Computers & Operations Research, 138, 105605.
  • Achamrah, F. E., Limbourg, S., Di Martinelly, C., & Riane, F. 2022. “A Matheuristic for Solving Inventory Sharing Problems: A corrigendum to experimental results.” https://orbi.uliege.be/bitstream/2268/292714/1/Corrigendum_to_CAOR_paper.pdf
  • Adulyasak, Y., J. F. Cordeau, and R. Jans. 2014a. “Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems.” INFORMS Journal on Computing 26: 103–120.
  • Adulyasak, Y., J. F. Cordeau, and R. Jans. 2014b. “Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem.” Transportation Science 48: 20–45.
  • Adulyasak, Y., J. F. Cordeau, and R. Jans. 2015. “The Production Routing Problem: A Review of Formulations and Solution Algorithms.” Computers & Operations Research 55: 141–152.
  • Andersson, H., A. Hoff, M. Christiansen, G. Hasle, and A. Løkketangen. 2010. “Industrial Aspects and Literature Survey: Combined Inventory Management and Routing.” Computers & Operations Research37: 1515–1536.
  • Archetti, C., L. Bertazzi, A. Hertz, and M. G. Speranza. 2012. “A Hybrid Heuristic for an Inventory Routing Problem.” INFORMS Journal on Computing 24: 101–116.
  • Archetti, C., L. Bertazzi, G. Laporte, and M. G. Speranza. 2007. “A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.” Transportation Science 41: 382–391.
  • Archetti, C., L. Bertazzi, G. Paletta, and M. G. Speranza. 2011. “Analysis of the Maximum Level Policy in a Production-Distribution System.” Computers & Operations Research 38: 1731–1746.
  • Archetti, C., N. Boland, and M. G. Speranza. 2017. “A Matheuristic for the Multivehicle Inventory Routing Problem.” INFORMS Journal on Computing 29: 377–387.
  • Archetti, C., G. Guastaroba, D. L. Huerta-Muñoz, and M. G. Speranza. 2021. “A Kernel Search Heuristic for the Multivehicle Inventory Routing Problem.” International Transactions in Operational Research 28: 2984–3013.
  • Archetti, C., and M. G. Speranza. 2014. “A Survey on Matheuristics for Routing Problems.” EURO Journal on Computational Optimization 2: 223–246.
  • Archetti, C., and M. G. Speranza. 2016. “The Inventory Routing Problem: The Value of Integration.” International Transactions in Operational Research 23: 393–407.
  • Armentano, V. A., A. L. Shiguemoto, and A. Løkketangen. 2011. “Tabu Search with Path Relinking for an Integrated Production–Distribution Problem.” Computers & Operations Research 38: 1199–1209.
  • Avci, M., and S. T. Yildiz. 2019. “A Matheuristic Solution Approach for the Production Routing Problem with Visit Spacing Policy.” European Journal of Operational Research 279: 572–588.
  • Bard, J. F., and N. Nananukul. 2009. “The Integrated Production–Inventory–Distribution–Routing Problem.” Journal of Scheduling 12: 257–280.
  • Boschetti, M. A., V. Maniezzo, M. Roffilli, and A. B. Röhler. 2009. “Matheuristics: Optimization, Simulation and Control.” International Workshop on Hybrid Metaheuristics 1: 171–177.
  • Boudia, M., M. A. O. Louly, and C. Prins. 2007. “A Reactive Grasp and Path Relinking for a Combined Production–Distribution Problem.” Computers & Operations Research 34: 3402–3419.
  • Boudia, M., and C. Prins. 2009. “A Memetic Algorithm with Dynamic Population Management for an Integrated Production–Distribution Problem.” European Journal of Operational Research 195: 703–715.
  • Brahimi, N., and T. Aouam. 2016. “Multi-Item Production Routing Problem with Backordering: A Milp Approach.” International Journal of Production Research 54: 1076–1093.
  • Chandra, P. 1993. “A Dynamic Distribution Model with Warehouse and Customer Replenishment Requirements.” Journal of the Operational Research Society 44: 681–692.
  • Chandra, P., and M. L. Fisher. 1994. “Coordination of Production and Distribution Planning.” European Journal of Operational Research 72: 503–517.
  • Chen, K., T. Xiao, S. Wang, and D. Lei. 2021. “Inventory Strategies for Perishable Products with Two-Period Shelf-Life and Lost Sales.” International Journal of Production Research 59: 5301–5320.
  • Chitsaz, M., J. F. Cordeau, and R. Jans. 2019. “A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing.” INFORMS Journal on Computing 31: 134–152.
  • Codato, G., and M. Fischetti. 2006. “Combinatorial Benders' Cuts for Mixed-Integer Linear Programming.” Operations Research 54: 756–766.
  • Coelho, L. C., J. F. Cordeau, and G. Laporte. 2014. “Thirty Years of Inventory Routing.” Transportation Science 48: 1–19.
  • Coelho, L. C., and G. Laporte. 2013. “The Exact Solution of Several Classes of Inventory-Routing Problems.” Computers & Operations Research 40: 558–565.
  • Duong, L. N. K., and J. Chong. 2020. “Supply Chain Collaboration in the Presence of Disruptions: A Literature Review.” International Journal of Production Research 58: 3488–3507.
  • Farghadani-Chaharsooghi, P., P. Kamranfar, M. S. Mirzapour Al-e Hashem, and Y. Rekik. 2022. “A Joint Production-Workforce-Delivery Stochastic Planning Problem for Perishable Items.” International Journal of Production Research 60 (20): 1–25.
  • Fisher, M. L., and R. Jaikumar. 1981. “A Generalized Assignment Heuristic for Vehicle Routing.” Networks 11: 109–124.
  • Ghasemkhani, A., R. Tavakkoli-Moghaddam, Y. Rahimi, S. Shahnejat-Bushehri, and H. Tavakkoli-Moghaddam. 2022. “Integrated Production-Inventory-Routing Problem for Multi-Perishable Products under Uncertainty by Meta-Heuristic Algorithms.” International Journal of Production Research 60: 2766–2786.
  • Guimarães, T. A., C. M. Schenekemberg, L. C. Coelho, C. T. Scarpin, and J. E. Pécora Jr. 2020. “Mechanisms for Feasibility and Improvement for Inventory-Routing Problems.” Technical Report number CIRRELT-2020-12. Université de Montréal, Canada.
  • Helsgaun, K. 2009. “General k-opt Submoves for the Lin–Kernighan TSP Heuristic.” Mathematical Programming Computation 1: 119–163.
  • Hrabec, D., L. M. Hvattum, and A. Hoff. 2022. “The Value of Integrated Planning for Production, Inventory, and Routing Decisions: A Systematic Review and Meta-analysis.” International Journal of Production Economics 248: 108468.
  • Juman, Z. A. M. S., R. M'Hallah, R. Lokuhetti, and O. Battaïa. 2021. “A Multi-Vendor Multi-Buyer Integrated Production-Inventory Model with Synchronised Unequal-Sized Batch Delivery.” International Journal of Production Research: 1–23. doi:10.1080/00207543.2021.2009586
  • Karimi, B., S. Fatemi Ghomi, and J. Wilson. 2003. “The Capacitated Lot Sizing Problem: A Review of Models and Algorithms.” Omega 31: 365–378.
  • Kumar, R., L. Ganapathy, R. Gokhale, and M. K. Tiwari. 2020. “Quantitative Approaches for the Integration of Production and Distribution Planning in the Supply Chain: A Systematic Literature Review.” International Journal of Production Research 58: 3527–3553.
  • Laporte, G. 2009. “Fifty Years of Vehicle Routing.” Transportation Science 43: 408–416.
  • Lei, L., S. Liu, A. Ruszczynski, and S. Park. 2006. “On the Integrated Production, Inventory, and Distribution Routing Problem.” IIE Transactions 38: 955–970.
  • Li, Y., F. Chu, C. Chu, and Z. Zhu. 2019. “An Efficient Three-Level Heuristic for the Large-Scaled Multi-Product Production Routing Problem with Outsourcing.” European Journal of Operational Research 272: 914–927.
  • Li, Y., F. Chu, J. F. Côté, L. C. Coelho, and C. Chu. 2020. “The Multi-Plant Perishable Food Production Routing with Packaging Consideration.” International Journal of Production Economics221: 107472.
  • Lin, S., and B. W. Kernighan. 1973. “An Effective Heuristic Algorithm for the Traveling-Salesman Problem.” Operations Research 21: 498–516.
  • Long, J., P. M. Pardalos, and C. Li. 2022. “Level-Based Multi-Objective Particle Swarm Optimizer for Integrated Production Scheduling and Vehicle Routing Decision with Inventory Holding, Delivery, and Tardiness Costs.” International Journal of Production Research 60: 3319–3338.
  • Low, C., C. M. Chang, R. K. Li, and C. L. Huang. 2014. “Coordination of Production Scheduling and Delivery Problems with Heterogeneous Fleet.” International Journal of Production Economics 153: 139–148.
  • Ma, K., R. Pal, and E. Gustafsson. 2019. “What Modelling Research on Supply Chain Collaboration Informs us? Identifying Key Themes and Future Directions Through a Literature Review.” International Journal of Production Research 57: 2203–2225.
  • Manousakis, E. G., G. A. Kasapidis, C. T. Kiranoudis, and E. E. Zachariadis. 2022. “An Infeasible Space Exploring Matheuristic for the Production Routing Problem.” European Journal of Operational Research 298: 478–495.
  • Manousakis, E., P. Repoussis, E. E. Zachariadis, and C. Tarantilis. 2020. “Improved Branch-and-Cut for the Inventory Routing Problem Based on a Two-Commodity Flow Formulation.” European Journal of Operational Research 290: 870–885.
  • Qiu, Y., L. Wang, X. Xu, X. Fang, and P. M. Pardalos. 2018. “A Variable Neighborhood Search Heuristic Algorithm for Production Routing Problems.” Applied Soft Computing 66: 311–318.
  • Ruokokoski, M., O. Solyali, J. F. Cordeau, R. Jans, and H. Süral. 2010. “Efficient Formulations and a Branch-and-Cut Algorithm for a Production-Routing Problem.” Technical Report Number G-2010-66. GERAD, HEC Montréal, Canada.
  • Russell, R. A. 2017. “Mathematical Programming Heuristics for the Production Routing Problem.” International Journal of Production Economics 193: 40–49.
  • Schenekemberg, C. M., C. T. Scarpin, J. E. Pecora Jr, T. A. Guimarães, and L. C. Coelho. 2021. “The Two-Echelon Production-Routing Problem.” European Journal of Operational Research 288: 436–449.
  • Solyalı, O., and H. Süral. 2017. “A Multi-Phase Heuristic for the Production Routing Problem.” Computers & Operations Research 87: 114–124.
  • Solyalı, O., and H. Süral. 2022. “An Effective Matheuristic for the Multivehicle Inventory Routing Problem.” Transportation Science 56: 1044–1057.
  • Toth, P., and A. Tramontani. 2008. “An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems.” In The Vehicle Routing Problem: Latest Advances and New Challenges, 275–295. Boston, MA: Springer.
  • Vadseth, S. T., H. Andersson, and M. Stålhane. 2021. “An Iterative Matheuristic for the Inventory Routing Problem.” Computers & Operations Research 131: 105262.
  • Vidal, T. 2020. “Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood.” arXiv preprint arXiv:2012.10384.
  • Vidal, T., T. G. Crainic, M. Gendreau, N. Lahrichi, and W. Rei. 2012. “A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems.” Operations Research 60: 611–624.
  • Wilcoxon, F. 1945. “Individual Comparisons by Ranking Methods.” Biometrics Bulletin 1: 80–83.
  • Zhang, Z., Z. Luo, R. Baldacci, and A. Lim. 2021. “A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy.” Transportation Science 55: 160–178.
  • Zou, X., L. Liu, K. Li, and W. Li. 2018. “A Coordinated Algorithm for Integrated Production Scheduling and Vehicle Routing Problem.” International Journal of Production Research 56: 5005–5024.