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

The Dynamic Team Orienteering Problem

Author

Listed:
  • Kirac, Emre
  • Milburn, Ashlea Bennett
  • Gedik, Ridvan

Abstract

This study introduces a new dynamic routing problem, namely the Dynamic Team Orienteering Problem (DTOP), which is a dynamic variant of the Team Orienteering Problem (TOP). In the DTOP, some customer locations are known a priori, while others are dynamic, with each location associated with a profit value. The goal is to maximize the sum of collected profits by visiting a set of customer locations within a time limit. This problem arises in several practical applications such as disaster relief, technician, tourist, and school bus routing problems. We adopt a Multiple Plan Approach (MPA) to solve the proposed problem, utilizing both a consensus function method and a demand-served method to select the distinguished plan—the most promising solution from a pool of alternative routing plans. To assess the effectiveness of these methods, we employ a sophisticated greedy algorithm tailored to address the unique challenges posed by the DTOP. In addition, we employ a reference offline algorithm designed for solving the static variant of the problem. To facilitate our evaluation, we introduce a comprehensive set of 1161 new benchmark instances for the DTOP, adapted from well-established TOP benchmark instances. Our comparative analysis centers on the average percentage deviation of algorithmic solutions from the reference offline solutions.

Suggested Citation

  • Kirac, Emre & Milburn, Ashlea Bennett & Gedik, Ridvan, 2025. "The Dynamic Team Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 324(1), pages 22-39.
    • Handle: RePEc:eee:ejores:v:324:y:2025:i:1:p:22-39
    DOI: 10.1016/j.ejor.2025.01.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725000347
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.01.009?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.

    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:324:y:2025:i:1:p:22-39. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.