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

A biased random-key genetic algorithm for the set orienteering problem

Author

Listed:
  • Carrabs, Francesco

Abstract

This paper addresses the Set Orienteering Problem which is a generalization of the Orienteering Problem where the customers are grouped in clusters, and the profit associated with each cluster is collected by visiting at least one of the customers in the respective cluster. The problem consists of finding a tour that maximizes the collected profit but, since the cost of the tour is limited by a threshold, only a subset of clusters can usually be visited. We propose a Biased Random-Key Genetic Algorithm for solving the Set Orienteering Problem in which three local search procedures are applied to improve the fitness of the chromosomes. In addition, we introduced three rules useful to reduce the size of the instances and to speed up the resolution of the problem. Finally, a hashtable is used to quickly retrieve the information that are required several times during the computation. The computational results, carried out on benchmark instances, show that our algorithm is significantly faster than the other algorithms, proposed in the literature, and it provides solutions very close to the best-known ones.

Suggested Citation

  • Carrabs, Francesco, 2021. "A biased random-key genetic algorithm for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 292(3), pages 830-854.
    • Handle: RePEc:eee:ejores:v:292:y:2021:i:3:p:830-854
    DOI: 10.1016/j.ejor.2020.11.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172031002X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.11.043?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. Pessoa, Luciana S. & Andrade, Carlos E., 2018. "Heuristics for a flowshop scheduling problem with stepwise job objective function," European Journal of Operational Research, Elsevier, vol. 266(3), pages 950-962.
    3. Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "A fast and effective heuristic for the orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 475-489, 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. Prabhakant Sinha & Andris A. Zoltners, 1979. "The Multiple-Choice Knapsack Problem," Operations Research, INFORMS, vol. 27(3), pages 503-515, June.
    6. Thiago Noronha & Mauricio Resende & Celso Ribeiro, 2011. "A biased random-key genetic algorithm for routing and wavelength assignment," Journal of Global Optimization, Springer, vol. 50(3), pages 503-518, July.
    7. Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1997. "A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 45(3), pages 378-394, June.
    8. Ramos, António G. & Silva, Elsa & Oliveira, José F., 2018. "A new load balance methodology for container loading problem in road transportation," European Journal of Operational Research, Elsevier, vol. 266(3), pages 1140-1152.
    9. Angelelli, E. & Archetti, C. & Vindigni, M., 2014. "The Clustered Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 404-414.
    10. Pěnička, Robert & Faigl, Jan & Saska, Martin, 2019. "Variable Neighborhood Search for the Set Orienteering Problem and its application to other Orienteering Problem variants," European Journal of Operational Research, Elsevier, vol. 276(3), pages 816-825.
    11. Francesco Carrabs & Carmine Cerrone & Raffaele Cerulli & Bruce Golden, 2020. "An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1030-1048, October.
    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. 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.
    2. Archetti, C. & Carrabs, F. & Cerulli, R. & Laureana, F., 2024. "A new formulation and a branch-and-cut algorithm for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 314(2), pages 446-465.

    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. 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.
    2. Archetti, C. & Carrabs, F. & Cerulli, R. & Laureana, F., 2024. "A new formulation and a branch-and-cut algorithm for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 314(2), pages 446-465.
    3. Dontas, Michael & Sideris, Georgios & Manousakis, Eleftherios G. & Zachariadis, Emmanouil E., 2023. "An adaptive memory matheuristic for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1010-1023.
    4. 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.
    5. Pěnička, Robert & Faigl, Jan & Saska, Martin, 2019. "Variable Neighborhood Search for the Set Orienteering Problem and its application to other Orienteering Problem variants," European Journal of Operational Research, Elsevier, vol. 276(3), pages 816-825.
    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. Katharina Glock & Anne Meyer, 2020. "Mission Planning for Emergency Rapid Mapping with Drones," Transportation Science, INFORMS, vol. 54(2), pages 534-560, March.
    8. Archetti, Claudia & Carrabs, Francesco & Cerulli, Raffaele, 2018. "The Set Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 267(1), pages 264-272.
    9. Xiaoyu Yu & Jingyi Qian & Yajing Zhang & Min Kong, 2023. "Supply Chain Scheduling Method for the Coordination of Agile Production and Port Delivery Operation," Mathematics, MDPI, vol. 11(15), pages 1-24, July.
    10. Wolfgang Wörndl & Alexander Hefele & Daniel Herzog, 2017. "Recommending a sequence of interesting places for tourist trips," Information Technology & Tourism, Springer, vol. 17(1), pages 31-54, March.
    11. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.
    12. Kotiloglu, S. & Lappas, T. & Pelechrinis, K. & Repoussis, P.P., 2017. "Personalized multi-period tour recommendations," Tourism Management, Elsevier, vol. 62(C), pages 76-88.
    13. 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.
    14. H Tang & E Miller-Hooks, 2005. "Algorithms for a stochastic selective travelling salesperson problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 439-452, April.
    15. Zheng, Weimin & Liao, Zhixue & Qin, Jing, 2017. "Using a four-step heuristic algorithm to design personalized day tour route within a tourist attraction," Tourism Management, Elsevier, vol. 62(C), pages 335-349.
    16. 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.
    17. Andrade, Carlos E. & Toso, Rodrigo F. & Gonçalves, José F. & Resende, Mauricio G.C., 2021. "The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications," European Journal of Operational Research, Elsevier, vol. 289(1), pages 17-30.
    18. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    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. Wolfgang Wörndl & Alexander Hefele & Daniel Herzog, 0. "Recommending a sequence of interesting places for tourist trips," Information Technology & Tourism, Springer, vol. 0, pages 1-24.

    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:292:y:2021:i:3:p:830-854. 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.