IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v258y2017i2d10.1007_s10479-017-2408-4.html
   My bibliography  Save this article

Formulations for the orienteering problem with additional constraints

Author

Listed:
  • Pamela J. Palomo-Martínez

    (Universidad Autónoma de Nuevo León)

  • M. Angélica Salazar-Aguilar

    (Universidad Autónoma de Nuevo León)

  • Víctor M. Albornoz

    (Universidad Técnica Federico Santa María)

Abstract

This paper addresses a variant of the Orienteering Problem taking into account mandatory visits and exclusionary constraints (conflicts among nodes). Five mixed integer linear formulations are adapted from the Traveling Salesman Problem literature in order to provide a robust formulation for this problem. The main difference among these formulations lies in the way they deal with the subtour elimination constraints. The performance of the proposed formulations is evaluated over a large set of instances. Computational results reveal that the model that avoids subtours by means of a single-commodity flow formulation allows to solve to optimality more instances than the other formulations, within a time limit of 1 h.

Suggested Citation

  • Pamela J. Palomo-Martínez & M. Angélica Salazar-Aguilar & Víctor M. Albornoz, 2017. "Formulations for the orienteering problem with additional constraints," Annals of Operations Research, Springer, vol. 258(2), pages 503-545, November.
    • Handle: RePEc:spr:annopr:v:258:y:2017:i:2:d:10.1007_s10479-017-2408-4
    DOI: 10.1007/s10479-017-2408-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2408-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-017-2408-4?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. Coelho, Leandro C. & Laporte, Gilbert, 2015. "Classification, models and exact algorithms for multi-compartment delivery problems," European Journal of Operational Research, Elsevier, vol. 242(3), pages 854-864.
    2. 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.
    3. 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.
    4. 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.
    5. Manuel Iori & Silvano Martello, 2010. "Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 4-27, July.
    6. 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.
    7. Gendreau, Michel & Manerba, Daniele & Mansini, Renata, 2016. "The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 248(1), pages 59-71.
    8. Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1998. "Solving the Orienteering Problem through Branch-and-Cut," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 133-148, May.
    9. 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.
    10. Manuel Iori & Silvano Martello, 2010. "Rejoinder on: Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 41-42, July.
    11. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    12. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lu, Yongliang & Benlic, Una & Wu, Qinghua, 2018. "A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints," European Journal of Operational Research, Elsevier, vol. 268(1), pages 54-69.
    2. Schulz, Arne & Pfeiffer, Christian, 2024. "A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).

    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. 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.
    2. 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.
    3. Bian, Zheyong & Liu, Xiang, 2018. "A real-time adjustment strategy for the operational level stochastic orienteering problem: A simulation-aided optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 246-266.
    4. Kobeaga, Gorka & Rojas-Delgado, Jairo & Merino, María & Lozano, Jose A., 2024. "A revisited branch-and-cut algorithm for large-scale orienteering problems," European Journal of Operational Research, Elsevier, vol. 313(1), pages 44-68.
    5. Orlis, Christos & Laganá, Demetrio & Dullaert, Wout & Vigo, Daniele, 2020. "Distribution with Quality of Service Considerations: The Capacitated Routing Problem with Profits and Service Level Requirements," Omega, Elsevier, vol. 93(C).
    6. Álvarez-Miranda, Eduardo & Luipersbeck, Martin & Sinnl, Markus, 2018. "Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems," European Journal of Operational Research, Elsevier, vol. 265(2), pages 779-794.
    7. 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.
    8. Wei Zhang & Kai Wang & Shuaian Wang & Gilbert Laporte, 2020. "Clustered coverage orienteering problem of unmanned surface vehicles for water sampling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(5), pages 353-367, August.
    9. 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.
    10. 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.
    11. Markus Sinnl, 2021. "Mixed-integer programming approaches for the time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 497-542, June.
    12. Gambardella, L.M. & Montemanni, R. & Weyland, D., 2012. "Coupling ant colony systems with strong local searches," European Journal of Operational Research, Elsevier, vol. 220(3), pages 831-843.
    13. 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.
    14. Jost, Christian & Jungwirth, Alexander & Kolisch, Rainer & Schiffels, Sebastian, 2022. "Consistent vehicle routing with pickup decisions - Insights from sport academy training transfers," European Journal of Operational Research, Elsevier, vol. 298(1), pages 337-350.
    15. 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.
    16. 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.
    17. Riera-Ledesma, Jorge & Salazar-González, Juan José, 2017. "Solving the Team Orienteering Arc Routing Problem with a column generation approach," European Journal of Operational Research, Elsevier, vol. 262(1), pages 14-27.
    18. Michael D. Moskal & Erdi Dasdemir & Rajan Batta, 2023. "Unmanned Aerial Vehicle Information Collection Missions with Uncertain Characteristics," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 120-137, January.
    19. Ruiz-Meza, José & Montoya-Torres, Jairo R., 2022. "A systematic literature review for the tourist trip design problem: Extensions, solution techniques and future research lines," Operations Research Perspectives, Elsevier, vol. 9(C).
    20. 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.

    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:spr:annopr:v:258:y:2017:i:2:d:10.1007_s10479-017-2408-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.