IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v46y2023i1p20-42.html
   My bibliography  Save this article

Solving the team orienteering problem with time windows and mandatory visits using a constraint programming approach

Author

Listed:
  • Emre Kirac
  • Ridvan Gedik
  • Furkan Oztanriseven

Abstract

This paper presents a constraint programming (CP) approach for solving the team orienteering problem with time windows and mandatory visits (TOPTW-MV), which has many real-world implementations, such as tourist tour planning, routing technicians, and disaster relief routing. In the TOPTW-MV, a set of locations is given; some locations must be visited, while others are optional. For each location, the profit, service time, and service time window information are known. A fleet of homogeneous vehicles is available for visiting locations and collecting the profits. The objective in solving this problem is to create a set of vehicle routes that begin and end at a depot, visit mandatory locations exactly once and optional locations at most once, while observing other restrictions such as time windows and sequence-based travel times. The CP-based approach finds 99 of the best-known solutions and explores 64 new best-known solutions for the benchmark instances.

Suggested Citation

  • Emre Kirac & Ridvan Gedik & Furkan Oztanriseven, 2023. "Solving the team orienteering problem with time windows and mandatory visits using a constraint programming approach," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 46(1), pages 20-42.
    • Handle: RePEc:ids:ijores:v:46:y:2023:i:1:p:20-42
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=128542
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:ijores:v:46:y:2023:i:1:p:20-42. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.