IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i14p2313-d1705769.html
   My bibliography  Save this article

Using Transformers and Reinforcement Learning for the Team Orienteering Problem Under Dynamic Conditions

Author

Listed:
  • Antoni Guerrero

    (Production Management and Engineering Research Centre, Universitat Politècnica de València, Plz. Ferrandiz-Salvador, 03801 Alcoy, Spain
    Baobab Soluciones, 55 Jose Abascal, 28003 Madrid, Spain)

  • Marc Escoto

    (Production Management and Engineering Research Centre, Universitat Politècnica de València, Plz. Ferrandiz-Salvador, 03801 Alcoy, Spain)

  • Majsa Ammouriova

    (School of Applied Technical Sciences, German Jordanian University, Amman 11180, Jordan
    Computer Science Department, Universitat Oberta de Catalunya, 156 Rambla Poblenou, 08018 Barcelona, Spain)

  • Yangchongyi Men

    (Production Management and Engineering Research Centre, Universitat Politècnica de València, Plz. Ferrandiz-Salvador, 03801 Alcoy, Spain)

  • Angel A. Juan

    (Production Management and Engineering Research Centre, Universitat Politècnica de València, Plz. Ferrandiz-Salvador, 03801 Alcoy, Spain
    Euncet Business School, Universitat Politècnica de Catalunya 1 Cami Mas Rubial, 08225 Terrassa, Spain)

Abstract

This paper presents a reinforcement learning (RL) approach for solving the team orienteering problem under both deterministic and dynamic travel time conditions. The proposed method builds on the transformer architecture and is trained to construct routes that adapt to real-time variations, such as traffic and environmental changes. A key contribution of this work is the model’s ability to generalize across problem instances with varying numbers of nodes and vehicles, eliminating the need for retraining when problem size changes. To assess performance, a comprehensive set of experiments involving 27,000 synthetic instances is conducted, comparing the RL model with a variable neighborhood search metaheuristic. The results indicate that the RL model achieves competitive solution quality while requiring significantly less computational time. Moreover, the RL approach consistently produces feasible solutions across all dynamic instances, demonstrating strong robustness in meeting time constraints. These findings suggest that learning-based methods can offer efficient, scalable, and adaptable solutions for routing problems in dynamic and uncertain environments.

Suggested Citation

  • Antoni Guerrero & Marc Escoto & Majsa Ammouriova & Yangchongyi Men & Angel A. Juan, 2025. "Using Transformers and Reinforcement Learning for the Team Orienteering Problem Under Dynamic Conditions," Mathematics, MDPI, vol. 13(14), pages 1-19, July.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:14:p:2313-:d:1705769
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/14/2313/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/14/2313/
    Download Restriction: no
    ---><---

    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. 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.
    3. Chen, Yuanyi & Hu, Simon & Zheng, Yanchong & Xie, Shiwei & Yang, Qiang & Wang, Yubin & Hu, Qinru, 2024. "Coordinated optimization of logistics scheduling and electricity dispatch for electric logistics vehicles considering uncertain electricity prices and renewable generation," Applied Energy, Elsevier, vol. 364(C).
    4. Gautam Patil & Gayatri Pode & Boucar Diouf & Ramchandra Pode, 2024. "Sustainable Decarbonization of Road Transport: Policies, Current Status, and Challenges of Electric Vehicles," Sustainability, MDPI, vol. 16(18), pages 1-41, September.
    5. Leandro do C. Martins & Rafael D. Tordecilla & Juliana Castaneda & Angel A. Juan & Javier Faulin, 2021. "Electric Vehicle Routing, Arc Routing, and Team Orienteering Problems in Sustainable Transportation," Energies, MDPI, vol. 14(16), pages 1-30, August.
    6. Edoardo Marcucci & Valerio Gatta & Michela Le Pira & Lisa Hansson & Svein Bråthen, 2020. "Digital Twins: A Critical Discussion on Their Potential for Supporting Policy-Making and Planning in Urban Logistics," Sustainability, MDPI, vol. 12(24), pages 1-15, December.
    7. Abdollahi, Mohammad & Yang, Xinan & Nasri, Moncef Ilies & Fairbank, Michael, 2023. "Demand management in time-slotted last-mile delivery via dynamic routing with forecast orders," European Journal of Operational Research, Elsevier, vol. 309(2), pages 704-718.
    8. Nikola Mardešić & Tomislav Erdelić & Tonči Carić & Marko Đurasević, 2023. "Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment," Mathematics, MDPI, vol. 12(1), pages 1-44, December.
    9. Yuanyuan Li & Claudia Archetti & Ivana Ljubić, 2024. "Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates," Transportation Science, INFORMS, vol. 58(5), pages 1143-1165, September.
    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. 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.
    2. 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.
    3. Rodríguez, Beatriz & Molina, Julián & Pérez, Fátima & Caballero, Rafael, 2012. "Interactive design of personalised tourism routes," Tourism Management, Elsevier, vol. 33(4), pages 926-940.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Ido Orenstein & Tal Raviv & Elad Sadan, 2019. "Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 683-711, December.
    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. 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.
    15. Renaud, Jacques & Boctor, Fayez F., 1998. "An efficient composite heuristic for the symmetric generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 571-584, August.
    16. Gendreau, Michel & Laporte, Gilbert & Semet, Frederic, 1998. "A tabu search heuristic for the undirected selective travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 539-545, April.
    17. Emilian Szczepański & Renata Żochowska & Mariusz Izdebski & Marianna Jacyna, 2025. "Decision-Making Problems in Urban Transport Decarbonization Strategies: Challenges, Tools, and Methods," Energies, MDPI, vol. 18(15), pages 1-17, July.
    18. Bock, Stefan & Bomsdorf, Stefan & Boysen, Nils & Schneider, Michael, 2025. "A survey on the Traveling Salesman Problem and its variants in a warehousing context," European Journal of Operational Research, Elsevier, vol. 322(1), pages 1-14.
    19. Dudu Guo & Yinuo Su & Xiaojiang Zhang & Zhen Yang & Pengbin Duan, 2024. "Multi-Objective Optimization of Short-Inverted Transport Scheduling Strategy Based on Road–Railway Intermodal Transport," Sustainability, MDPI, vol. 16(15), pages 1-25, July.
    20. 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.

    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:gam:jmathe:v:13:y:2025:i:14:p:2313-:d:1705769. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.