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

An adaptive ejection pool with toggle-rule diversification approach for the capacitated team orienteering problem

Author

Listed:
  • Luo, Zhixing
  • Cheang, Brenda
  • Lim, Andrew
  • Zhu, Wenbin

Abstract

In the capacitated team orienteering problem (CTOP), we are given a set of homogeneous vehicles and a set of customers each with a service demand value and a profit value. A vehicle can get the profit of a customer by satisfying its demand, but the total demand of all customers in its route cannot exceed the vehicle capacity and the length of the route must be within a specified maximum. The problem is to design a set of routes that maximizes the total profit collected by the vehicles. In this article, we propose a new heuristic algorithm for the CTOP using the ejection pool framework with an adaptive strategy and a diversification mechanism based on toggling between two priority rules. Experimental results show that our algorithm can match or improve all the best known results on the standard CTOP benchmark instances proposed by Archetti et al. (2008).

Suggested Citation

  • Luo, Zhixing & Cheang, Brenda & Lim, Andrew & Zhu, Wenbin, 2013. "An adaptive ejection pool with toggle-rule diversification approach for the capacitated team orienteering problem," European Journal of Operational Research, Elsevier, vol. 229(3), pages 673-682.
    • Handle: RePEc:eee:ejores:v:229:y:2013:i:3:p:673-682
    DOI: 10.1016/j.ejor.2012.12.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171200968X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.12.020?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. Vansteenwegen, Pieter & Souffriau, Wouter & Berghe, Greet Vanden & Oudheusden, Dirk Van, 2009. "A guided local search metaheuristic for the team orienteering problem," European Journal of Operational Research, Elsevier, vol. 196(1), pages 118-127, July.
    2. 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.
    3. Andrew Lim & Xingwen Zhang, 2007. "A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 443-457, August.
    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. Asma Ben-Said & Racha El-Hajj & Aziz Moukrim, 2019. "A variable space search heuristic for the Capacitated Team Orienteering Problem," Journal of Heuristics, Springer, vol. 25(2), pages 273-303, April.
    2. Zhao, Yanlu & Alfandari, Laurent, 2020. "Design of diversified package tours for the digital travel industry : A branch-cut-and-price approach," European Journal of Operational Research, Elsevier, vol. 285(3), pages 825-843.

    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. 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.
    2. 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.
    3. 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.
    4. Lin, Shih-Wei & Yu, Vincent F., 2012. "A simulated annealing heuristic for the team orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 217(1), pages 94-107.
    5. Dang, Duc-Cuong & Guibadj, Rym Nesrine & Moukrim, Aziz, 2013. "An effective PSO-inspired algorithm for the team orienteering problem," European Journal of Operational Research, Elsevier, vol. 229(2), pages 332-344.
    6. 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).
    7. Divsalar, A. & Vansteenwegen, P. & Cattrysse, D., 2013. "A variable neighborhood search method for the orienteering problem with hotel selection," International Journal of Production Economics, Elsevier, vol. 145(1), pages 150-160.
    8. Krzysztof Ostrowski & Joanna Karbowska-Chilinska & Jolanta Koszelew & Pawel Zabielski, 2017. "Evolution-inspired local improvement algorithm solving orienteering problem," Annals of Operations Research, Springer, vol. 253(1), pages 519-543, June.
    9. Zhao, Yanlu & Alfandari, Laurent, 2020. "Design of diversified package tours for the digital travel industry : A branch-cut-and-price approach," European Journal of Operational Research, Elsevier, vol. 285(3), pages 825-843.
    10. Erika M. Herrera & Javier Panadero & Patricia Carracedo & Angel A. Juan & Elena Perez-Bernabeu, 2022. "Determining Reliable Solutions for the Team Orienteering Problem with Probabilistic Delays," Mathematics, MDPI, vol. 10(20), pages 1-15, October.
    11. Labadie, Nacima & Mansini, Renata & Melechovský, Jan & Wolfler Calvo, Roberto, 2012. "The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search," European Journal of Operational Research, Elsevier, vol. 220(1), pages 15-27.
    12. 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.
    13. Morteza Keshtkaran & Koorush Ziarati & Andrea Bettinelli & Daniele Vigo, 2016. "Enhanced exact solution methods for the Team Orienteering Problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 591-601, January.
    14. Zhiping Zuo & Yanhui Li & Jing Fu & Jianlin Wu, 2019. "Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints," Mathematics, MDPI, vol. 7(7), pages 1-18, July.
    15. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2010. "An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles," European Journal of Operational Research, Elsevier, vol. 202(3), pages 756-763, May.
    16. 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.
    17. 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.
    18. 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.
    19. Fleckenstein, David & Klein, Robert & Steinhardt, Claudius, 2023. "Recent advances in integrating demand management and vehicle routing: A methodological review," European Journal of Operational Research, Elsevier, vol. 306(2), pages 499-518.
    20. Kai Shen & Jan-Dirk Schmöcker & Wenzhe Sun & Ali Gul Qureshi, 2023. "Calibration of sightseeing tour choices considering multiple decision criteria with diminishing reward," Transportation, Springer, vol. 50(5), pages 1897-1921, October.

    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:229:y:2013:i:3:p:673-682. 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.