IDEAS home Printed from https://ideas.repec.org/a/eee/oprepe/v15y2025ics2214716025000338.html

A meta-analysis of set partitioning/set covering based matheuristics for vehicle routing problems

Author

Listed:
  • Arenas-Vasco, Alejandro
  • Alcázar, Daniela
  • Villegas, Juan G.

Abstract

The Vehicle Routing Problem (VRP) is a cornerstone of operations research with broad real-world relevance. As variants increase in complexity, researchers increasingly adopt metaheuristics and matheuristics to find high-quality solutions. We focus on set partitioning (SP) and set covering (SC) formulations as enhancement mechanisms in matheuristics for VRPs. These methods exploit previously generated routes by decomposing and recombining solutions, either as a post-optimization step or iteratively. We conducted a meta-analysis of 30 implementations, selected from 54 eligible studies identified via systematic review of Web of Science and Scopus, complemented by backward snowballing. Using a random-effects model, we quantified the effect of SP/SC enhancements on solution quality. On average, SP/SC improved solutions by 0.51% (95% CI: 0.41%–0.61%). Although the numerical gains are modest, they are consistent and significant, highlighting the practical value of these classical formulations in hybrid heuristic frameworks.

Suggested Citation

  • Arenas-Vasco, Alejandro & Alcázar, Daniela & Villegas, Juan G., 2025. "A meta-analysis of set partitioning/set covering based matheuristics for vehicle routing problems," Operations Research Perspectives, Elsevier, vol. 15(C).
    • Handle: RePEc:eee:oprepe:v:15:y:2025:i:c:s2214716025000338
    DOI: 10.1016/j.orp.2025.100357
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2214716025000338
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.orp.2025.100357?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Blum, Christian & Lozano, José A. & Davidson, Pinacho, 2015. "Mathematical programming strategies for solving the minimum common string partition problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 769-777.
    2. Najib Errami & Eduardo Queiroga & Ruslan Sadykov & Eduardo Uchoa, 2024. "VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 36(4), pages 956-965, July.
    3. Y H Lee & J I Kim & K H Kang & K H Kim, 2008. "A heuristic for vehicle fleet mix problem using tabu search and set partitioning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 833-841, June.
    4. M. L. Balinski & R. E. Quandt, 1964. "On an Integer Program for a Delivery Problem," Operations Research, INFORMS, vol. 12(2), pages 300-304, April.
    5. Nurul Huda Mohamed & Said Salhi & Gábor Nagy & Nurul Akmal Mohamed, 2019. "A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 15(1), pages 65-91.
    6. Jiefeng Xu & James P. Kelly, 1996. "A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem," Transportation Science, INFORMS, vol. 30(4), pages 379-393, November.
    7. Graham Kendall & Ruibin Bai & Jacek Błazewicz & Patrick De Causmaecker & Michel Gendreau & Robert John & Jiawei Li & Barry McCollum & Erwin Pesch & Rong Qu & Nasser Sabar & Greet Vanden Berghe , 2016. "Good Laboratory Practice for optimization research," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(4), pages 676-689, April.
    8. James P. Kelly & Jiefeng Xu, 1999. "A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 161-172, May.
    9. Maximilian Schiffer & Michael Schneider & Grit Walther & Gilbert Laporte, 2019. "Vehicle Routing and Location Routing with Intermediate Stops: A Review," Transportation Science, INFORMS, vol. 53(2), pages 319-343, March.
    10. Sandra Huber & Jean-François Cordeau & Martin Josef Geiger, 2020. "A matheuristic for the swap body vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 111-160, March.
    11. Turkeš, Renata & Sörensen, Kenneth & Hvattum, Lars Magnus, 2021. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," European Journal of Operational Research, Elsevier, vol. 292(2), pages 423-442.
    12. Mehmet Anıl Akbay & Christian Blum & Can Berk Kalayci, 2024. "CMSA based on set covering models for packing and routing problems," Annals of Operations Research, Springer, vol. 343(1), pages 1-38, December.
    13. Grenouilleau, Florian & Legrain, Antoine & Lahrichi, Nadia & Rousseau, Louis-Martin, 2019. "A set partitioning heuristic for the home health care routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 295-303.
    14. Alejandro Arenas-Vasco & Juan Carlos Rivera & Maria Gulnara Baldoquín, 2024. "Effect of formulations over a Periodic Capacitated Vehicle Routing Problem with multiple depots, heterogeneous fleet, and hard time-windows," PLOS ONE, Public Library of Science, vol. 19(10), pages 1-19, October.
    15. Wang, Weiquan & Zhao, Jingyi, 2023. "Partial linear recharging strategy for the electric fleet size and mix vehicle routing problem with time windows and recharging stations," European Journal of Operational Research, Elsevier, vol. 308(2), pages 929-948.
    16. Kramer, Raphael & Subramanian, Anand & Vidal, Thibaut & Cabral, Lucídio dos Anjos F., 2015. "A matheuristic approach for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 243(2), pages 523-539.
    17. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    18. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    19. Jorge E. Mendoza & Louis-Martin Rousseau & Juan G. Villegas, 2016. "A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints," Journal of Heuristics, Springer, vol. 22(4), pages 539-566, August.
    20. Kloster, Konstantin & Moeini, Mahdi & Vigo, Daniele & Wendt, Oliver, 2023. "The multiple traveling salesman problem in presence of drone- and robot-supported packet stations," European Journal of Operational Research, Elsevier, vol. 305(2), pages 630-643.
    21. Subramanian, Anand & Penna, Puca Huachi Vaz & Uchoa, Eduardo & Ochi, Luiz Satoru, 2012. "A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 221(2), pages 285-295.
    22. Michael F. Gorman & John-Paul Clarke & Amir Hossein Gharehgozli & Michael Hewitt & René de Koster & Debjit Roy, 2014. "State of the Practice: A Review of the Application of OR/MS in Freight Transportation," Interfaces, INFORMS, vol. 44(6), pages 535-554, December.
    23. Montoya, Alejandro & Guéret, Christelle & Mendoza, Jorge E. & Villegas, Juan G., 2017. "The electric vehicle routing problem with nonlinear charging function," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 87-110.
    24. Ruiz, Ruben & Maroto, Concepcion & Alcaraz, Javier, 2004. "A decision support system for a real vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 153(3), pages 593-606, March.
    25. Chris Groër & Bruce Golden & Edward Wasil, 2011. "A Parallel Algorithm for the Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 315-330, May.
    26. J-F Cordeau & M Gendreau & G Laporte & J-Y Potvin & F Semet, 2002. "A guide to vehicle routing heuristics," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(5), pages 512-522, May.
    27. Martí, Rafael & Sevaux, Marc & Sörensen, Kenneth, 2025. "Fifty years of metaheuristics," European Journal of Operational Research, Elsevier, vol. 321(2), pages 345-362.
    28. Kenneth Sörensen & Marc Sevaux & Fred Glover, 2018. "A History of Metaheuristics," Springer Books, in: Rafael Martí & Panos M. Pardalos & Mauricio G. C. Resende (ed.), Handbook of Heuristics, chapter 27, pages 791-808, Springer.
    29. Jourdan, L. & Basseur, M. & Talbi, E.-G., 2009. "Hybridizing exact methods and metaheuristics: A taxonomy," European Journal of Operational Research, Elsevier, vol. 199(3), pages 620-629, December.
    30. Milan Stanojević & Bogdana Stanojević, 2014. "Set-Covering-Based Approximate Algorithm Using Enhanced Savings for Solving Vehicle Routing Problem," Palgrave Macmillan Books, in: Maja Levi Jakšić & Slađana Barjaktarović Rakočević & Milan Martić (ed.), Innovative Management and Firm Performance, chapter 22, pages 422-443, Palgrave Macmillan.
    31. Aurélien Froger & Ola Jabali & Jorge E. Mendoza & Gilbert Laporte, 2022. "The Electric Vehicle Routing Problem with Capacitated Charging Stations," Transportation Science, INFORMS, vol. 56(2), pages 460-482, March.
    32. Nabil Absi & Diego Cattaruzza & Dominique Feillet & Sylvain Housseman, 2017. "A relax-and-repair heuristic for the Swap-Body Vehicle Routing Problem," Annals of Operations Research, Springer, vol. 253(2), pages 957-978, June.
    33. Tobias Achterberg & Robert E. Bixby & Zonghao Gu & Edward Rothberg & Dieter Weninger, 2020. "Presolve Reductions in Mixed Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 473-506, April.
    34. Villegas, Juan G. & Prins, Christian & Prodhon, Caroline & Medaglia, Andrés L. & Velasco, Nubia, 2013. "A matheuristic for the truck and trailer routing problem," European Journal of Operational Research, Elsevier, vol. 230(2), pages 231-244.
    35. Puca Huachi Vaz Penna & Anand Subramanian & Luiz Satoru Ochi & Thibaut Vidal & Christian Prins, 2019. "A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet," Annals of Operations Research, Springer, vol. 273(1), pages 5-74, February.
    36. Hiermann, Gerhard & Hartl, Richard F. & Puchinger, Jakob & Vidal, Thibaut, 2019. "Routing a mix of conventional, plug-in hybrid, and electric vehicles," European Journal of Operational Research, Elsevier, vol. 272(1), pages 235-248.
    37. Paessens, H., 1988. "The savings algorithm for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 34(3), pages 336-344, March.
    38. Voigt, Stefan, 2025. "A review and ranking of operators in adaptive large neighborhood search for vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 322(2), pages 357-375.
    39. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    40. Cortés-Murcia, David L. & Prodhon, Caroline & Murat Afsar, H., 2019. "The electric vehicle routing problem with time windows, partial recharges and satellite customers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 130(C), pages 184-206.
    41. Russell, Robert A. & Chiang, Wen-Chyuan, 2006. "Scatter search for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 169(2), pages 606-622, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    2. Dönmez, Sercan & Koç, Çağrı & Altıparmak, Fulya, 2022. "The mixed fleet vehicle routing problem with partial recharging by multiple chargers: Mathematical model and adaptive large neighborhood search," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    3. Cortés-Murcia, David L. & Prodhon, Caroline & Murat Afsar, H., 2019. "The electric vehicle routing problem with time windows, partial recharges and satellite customers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 130(C), pages 184-206.
    4. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    5. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    6. Nolz, Pamela C. & Absi, Nabil & Feillet, Dominique & Seragiotto, Clóvis, 2022. "The consistent electric-Vehicle routing problem with backhauls and charging management," European Journal of Operational Research, Elsevier, vol. 302(2), pages 700-716.
    7. Malladi, Satya S. & Christensen, Jonas M. & Ramírez, David & Larsen, Allan & Pacino, Dario, 2022. "Stochastic fleet mix optimization: Evaluating electromobility in urban logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    8. Wang, Weiquan & Zhao, Jingyi, 2023. "Partial linear recharging strategy for the electric fleet size and mix vehicle routing problem with time windows and recharging stations," European Journal of Operational Research, Elsevier, vol. 308(2), pages 929-948.
    9. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
    10. Puca Huachi Vaz Penna & Anand Subramanian & Luiz Satoru Ochi & Thibaut Vidal & Christian Prins, 2019. "A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet," Annals of Operations Research, Springer, vol. 273(1), pages 5-74, February.
    11. Lera-Romero, Gonzalo & Miranda Bront, Juan José & Soulignac, Francisco J., 2024. "A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 312(3), pages 978-995.
    12. Rafael Grosso-delaVega & Jesús Muñuzuri & Alejandro Escudero-Santana, 2025. "Solving a real case of rich vehicle routing problem with zone-dependent transportation costs," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 33(3), pages 1171-1192, September.
    13. Angel A. Juan & Peter Keenan & Rafael Martí & Seán McGarraghy & Javier Panadero & Paula Carroll & Diego Oliva, 2023. "A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics," Annals of Operations Research, Springer, vol. 320(2), pages 831-861, January.
    14. Bhoopalam, Anirudh Kishore & Agatz, Niels & Zuidwijk, Rob, 2018. "Planning of truck platoons: A literature review and directions for future research," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 212-228.
    15. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "A unified solution framework for multi-attribute vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 658-673.
    16. Kerscher, Christoph & Minner, Stefan, 2025. "Decompose-route-improve framework for solving large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 204(C).
    17. Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y., 2025. "Scheduling electric vehicle regular charging tasks: A review of deterministic models," European Journal of Operational Research, Elsevier, vol. 325(2), pages 221-232.
    18. Sandra Huber & Jean-François Cordeau & Martin Josef Geiger, 2020. "A matheuristic for the swap body vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 111-160, March.
    19. Liu, Chenglin & Xu, Zhihang & Xu, Zhigang & Zhang, Meng & Gao, Ying & Wang, Jianqiang & Qu, Xiaobo, 2025. "Joint route and charging schedule optimization for electric vehicles considering nonlinear charging process using State-Space-Time networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 201(C).
    20. Wouter ten Bosch & Han Hoogeveen & Marcel van Kooten Niekerk & Philip de Bruin, 2026. "Scheduling electric vehicles by simulated annealing with recombination through ILP," Public Transport, Springer, vol. 18(1), pages 211-228, March.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:oprepe:v:15:y:2025:i:c:s2214716025000338. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/operations-research-perspectives .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.