IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v320y2025i1p1-19.html
   My bibliography  Save this article

A unifying framework for selective routing problems

Author

Listed:
  • Dursunoglu, Cagla F.
  • Arslan, Okan
  • Demir, Sebnem Manolya
  • Kara, Bahar Y.
  • Laporte, Gilbert

Abstract

We present a unifying framework for Selective Routing Problems (SRPs) through a systematic analysis. The common goal in SRPs is to determine an optimal vehicle route to serve a subset of vertices while covering another subset. They arise in diverse fields such as logistics, public health, disaster response, and urban development. To establish a unifying framework for different but related problems, we associate the notion of service with coverage and argue that routing is a tool of service. We classify SRPs according to their selectiveness degree and emphasize the breadth and depth of this problem in terms of its characteristics. This SRP framework helps us identify research gaps as well as potential future research areas. We present a generic mathematical model, use it to describe the connections among these problems and identify some identical problems presented under different names.

Suggested Citation

  • Dursunoglu, Cagla F. & Arslan, Okan & Demir, Sebnem Manolya & Kara, Bahar Y. & Laporte, Gilbert, 2025. "A unifying framework for selective routing problems," European Journal of Operational Research, Elsevier, vol. 320(1), pages 1-19.
    • Handle: RePEc:eee:ejores:v:320:y:2025:i:1:p:1-19
    DOI: 10.1016/j.ejor.2024.02.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724001693
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.02.037?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Archetti, Claudia & Carrabs, Francesco & Cerulli, Raffaele, 2018. "The Set Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 267(1), pages 264-272.
    2. Perl, Jossef & Daskin, Mark S., 1985. "A warehouse location-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 19(5), pages 381-396, October.
    3. Charles S. Revelle & Gilbert Laporte, 1996. "The Plant Location Problem: New Models and Research Prospects," Operations Research, INFORMS, vol. 44(6), pages 864-874, December.
    4. Elfe Buluc & Meltem Peker & Bahar Y. Kara & Manoj Dora, 2022. "Covering vehicle routing problem: application for mobile child friendly spaces for refugees," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 461-484, June.
    5. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.
    6. Wolfinger, David & Gansterer, Margaretha & Doerner, Karl F. & Popper, Nikolas, 2023. "A Large Neighbourhood Search Metaheuristic for the Contagious Disease Testing Problem," European Journal of Operational Research, Elsevier, vol. 304(1), pages 169-182.
    7. Tang, Hao & Miller-Hooks, Elise & Tomastik, Robert, 2007. "Scheduling technicians for planned maintenance of geographically distributed equipment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(5), pages 591-609, September.
    8. Mina, Hokey & Jayaraman, Vaidyanathan & Srivastava, Rajesh, 1998. "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, Elsevier, vol. 108(1), pages 1-15, July.
    9. J. Beasley & E. Nascimento, 1996. "The Vehicle Routing-Allocation Problem: A unifying framework," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(1), pages 65-86, June.
    10. Angelelli, E. & Archetti, C. & Vindigni, M., 2014. "The Clustered Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 404-414.
    11. Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
    12. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    13. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    14. Lawrence D. Bodin & Lon Berman, 1979. "Routing and Scheduling of School Buses by Computer," Transportation Science, INFORMS, vol. 13(2), pages 113-129, May.
    15. De Kort, J. B. J. M. & Volgenant, A., 1994. "On the generalized 2-peripatetic salesman problem," European Journal of Operational Research, Elsevier, vol. 73(1), pages 175-180, February.
    16. Labbe, Martine & Laporte, Gilbert & Rodriguez Martin, Inmaculada & Gonzalez, Juan Jose Salazar, 2005. "Locating median cycles in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 457-470, January.
    17. Şahinyazan, Feyza Güliz & Kara, Bahar Y. & Taner, Mehmet Rüştü, 2015. "Selective vehicle routing for a mobile blood donation system," European Journal of Operational Research, Elsevier, vol. 245(1), pages 22-34.
    18. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    19. Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
    20. Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "The team orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 464-474, February.
    21. John R. Current & David A. Schilling, 1989. "The Covering Salesman Problem," Transportation Science, INFORMS, vol. 23(3), pages 208-213, August.
    22. Bruce Golden & Zahra Naji-Azimi & S. Raghavan & Majid Salari & Paolo Toth, 2012. "The Generalized Covering Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 534-553, November.
    23. Jesse Pietz & Johannes O. Royset, 2013. "Generalized orienteering problem with resource dependent rewards," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 294-312, June.
    24. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    25. Candace Arai Yano & Thomas J. Chan & Lori Kaplan Richter & Theodore Cutler & Katta G. Murty & David McGettigan, 1987. "Vehicle Routing at Quality Stores," Interfaces, INFORMS, vol. 17(2), pages 52-63, April.
    26. Arslan, Okan, 2021. "The location-or-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 1-21.
    27. Desrochers, M. & Lenstra, J. K. & Savelsbergh, M. W. P., 1990. "A classification scheme for vehicle routing and scheduling problems," European Journal of Operational Research, Elsevier, vol. 46(3), pages 322-332, June.
    28. Karaoğlan, İsmail & Erdoğan, Güneş & Koç, Çağrı, 2018. "The Multi-Vehicle Probabilistic Covering Tour Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 278-287.
    29. Ghiani, Gianpaolo & Improta, Gennaro, 2000. "An efficient transformation of the generalized vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 11-17, April.
    30. E. Erkut & J. Zhang, 1996. "The maximum collection problem with time‐dependent rewards," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(5), pages 749-763, August.
    31. Jacobsen, S. K. & Madsen, O. B. G., 1980. "A comparative study of heuristics for a two-level routing-location problem," European Journal of Operational Research, Elsevier, vol. 5(6), pages 378-387, December.
    32. Golden, Bruce & Levy, Larry & Dahl, Roy, 1981. "Two generalizations of the traveling salesman problem," Omega, Elsevier, vol. 9(4), pages 439-441.
    33. Naji-Azimi, Z. & Renaud, J. & Ruiz, A. & Salari, M., 2012. "A covering tour approach to the location of satellite distribution centers to supply humanitarian aid," European Journal of Operational Research, Elsevier, vol. 222(3), pages 596-605.
    34. Ting, Chuan-Kang & Liao, Xin-Lan, 2013. "The selective pickup and delivery problem: Formulation and a memetic algorithm," International Journal of Production Economics, Elsevier, vol. 141(1), pages 199-211.
    35. C Archetti & D Feillet & A Hertz & M G Speranza, 2009. "The capacitated team orienteering and profitable tour problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(6), pages 831-842, June.
    36. J Privé & J Renaud & F Boctor & G Laporte, 2006. "Solving a vehicle-routing problem arising in soft-drink distribution," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1045-1052, September.
    37. Gilbert Laporte & Jorge Riera-Ledesma & Juan-José Salazar-González, 2003. "A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem," Operations Research, INFORMS, vol. 51(6), pages 940-951, December.
    38. G Laporte, 2010. "A concise guide to the Traveling Salesman Problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 35-40, January.
    39. Ahn, Jaemyung & de Weck, Olivier & Geng, Yue & Klabjan, Diego, 2012. "Column generation based heuristics for a generalized location routing problem with profits arising in space exploration," European Journal of Operational Research, Elsevier, vol. 223(1), pages 47-59.
    40. Bruce L. Golden & Larry Levy & Rakesh Vohra, 1987. "The orienteering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 307-318, June.
    41. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    42. Current, John R. & Schilling, David A., 1994. "The median tour and maximal covering tour problems: Formulations and heuristics," European Journal of Operational Research, Elsevier, vol. 73(1), pages 114-126, February.
    43. Newton, Rita M. & Thomas, Warren H., 1969. "Design of school bus routes by computer," Socio-Economic Planning Sciences, Elsevier, vol. 3(1), pages 75-85, June.
    44. Balcik, Burcu, 2017. "Site selection and vehicle routing for post-disaster rapid needs assessment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 30-58.
    45. Noon, Charles E. & Mittenthal, John & Pillai, Rekha, 1994. "A TSSP + 1 decomposition strategy for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 79(3), pages 524-536, December.
    46. Michel Gendreau & Gilbert Laporte & Frédéric Semet, 1997. "The Covering Tour Problem," Operations Research, INFORMS, vol. 45(4), pages 568-576, August.
    47. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    48. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
    49. Di Placido, Andrea & Archetti, Claudia & Cerrone, Carmine & Golden, Bruce, 2023. "The generalized close enough traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 310(3), pages 974-991.
    50. Erdogan, Günes & Cordeau, Jean-François & Laporte, Gilbert, 2010. "The Attractive Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 59-69, May.
    51. G. Gutiérrez-Jarpa & V. Marianov & C. Obreque, 2009. "A single vehicle routing problem with fixed delivery and optional collections," IISE Transactions, Taylor & Francis Journals, vol. 41(12), pages 1067-1079.
    52. R. Baldacci & M. Dell'Amico & J. Salazar González, 2007. "The Capacitated m -Ring-Star Problem," Operations Research, INFORMS, vol. 55(6), pages 1147-1162, December.
    53. José Ruiz-Meza & Jairo R. Montoya-Torres, 2021. "Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations," Annals of Operations Research, Springer, vol. 305(1), pages 227-249, October.
    54. Li, Baoxiang & Krushinsky, Dmitry & Reijers, Hajo A. & Van Woensel, Tom, 2014. "The Share-a-Ride Problem: People and parcels sharing taxis," European Journal of Operational Research, Elsevier, vol. 238(1), pages 31-40.
    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. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    2. Miranda, Pablo A. & Blazquez, Carola A. & Obreque, Carlos & Maturana-Ross, Javier & Gutierrez-Jarpa, Gabriel, 2018. "The bi-objective insular traveling salesman problem with maritime and ground transportation costs," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1014-1036.
    3. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    4. Katharina Glock & Anne Meyer, 2020. "Mission Planning for Emergency Rapid Mapping with Drones," Transportation Science, INFORMS, vol. 54(2), pages 534-560, March.
    5. Yu, Qinxiao & Fang, Kan & Zhu, Ning & Ma, Shoufeng, 2019. "A matheuristic approach to the orienteering problem with service time dependent profits," European Journal of Operational Research, Elsevier, vol. 273(2), pages 488-503.
    6. Fischer, Vera & Pacheco Paneque, Meritxell & Legrain, Antoine & Bürgy, Reinhard, 2024. "A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection," European Journal of Operational Research, Elsevier, vol. 315(1), pages 338-353.
    7. Veenstra, Marjolein & Roodbergen, Kees Jan & Coelho, Leandro C. & Zhu, Stuart X., 2018. "A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands," European Journal of Operational Research, Elsevier, vol. 268(2), pages 703-715.
    8. Zhou, Lin & Baldacci, Roberto & Vigo, Daniele & Wang, Xu, 2018. "A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution," European Journal of Operational Research, Elsevier, vol. 265(2), pages 765-778.
    9. Eda Yücel & F. Sibel Salman & Burçin Bozkaya & Cemre Gökalp, 2020. "A data-driven optimization framework for routing mobile medical facilities," Annals of Operations Research, Springer, vol. 291(1), pages 1077-1102, August.
    10. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    11. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    12. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
    13. Ahmadi-Javid, Amir & Amiri, Elahe & Meskar, Mahla, 2018. "A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm," European Journal of Operational Research, Elsevier, vol. 271(3), pages 866-881.
    14. Li, Jiaojiao & Zhu, Jianghan & Peng, Guansheng & Wang, Jianjiang & Zhen, Lu & Demeulemeester, Erik, 2024. "Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits," European Journal of Operational Research, Elsevier, vol. 319(3), pages 793-807.
    15. Freeman, Nickolas K. & Keskin, Burcu B. & Çapar, İbrahim, 2018. "Attractive orienteering problem with proximity and timing interactions," European Journal of Operational Research, Elsevier, vol. 266(1), pages 354-370.
    16. Oruc, Buse Eylul & Kara, Bahar Yetis, 2018. "Post-disaster assessment routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 76-102.
    17. Wu, Qinghua & He, Mu & Hao, Jin-Kao & Lu, Yongliang, 2024. "An effective hybrid evolutionary algorithm for the clustered orienteering problem," European Journal of Operational Research, Elsevier, vol. 313(2), pages 418-434.
    18. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
    19. Qinxiao Yu & Yossiri Adulyasak & Louis-Martin Rousseau & Ning Zhu & Shoufeng Ma, 2022. "Team Orienteering with Time-Varying Profit," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 262-280, January.
    20. Arslan, Okan, 2021. "The location-or-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 1-21.

    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:ejores:v:320:y:2025:i:1:p:1-19. 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.elsevier.com/locate/eor .

    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.