IDEAS home Printed from https://ideas.repec.org/a/spr/infott/v26y2024i4d10.1007_s40558-024-00297-w.html
   My bibliography  Save this article

Solving the tourist trip planning problem with attraction patterns using meta-heuristic techniques

Author

Listed:
  • Kadri Sylejmani

    (University of Prishtina)

  • Vigan Abdurrahmani

    (University of Prishtina)

  • Arben Ahmeti

    (Riinvest College)

  • Egzon Gashi

    (University of Prishtina)

Abstract

The Tourist Trip Design Problem (TTDP) is a challenging task that involves designing an optimal travel itinerary for a tourist visiting multiple Points of Interest (POIs) within a specific city or region, while considering budget, time constraints, and multiple knapsack constraints. To create a customized itinerary that maximizes enjoyment and minimizes travel costs, factors such as POI distance, attractions, categories of POIs, and the tourist’s preferences must be considered. This paper introduces a local search technique for an extended variant of TTDP that includes pattern sequence for POI categories, recently defined by our team. Our approach builds upon existing state-of-the-art solvers based on ILS for the Multi Constrained Team Orienteering Problem with Time Windows (MCTOPTW) variant. The approach has been put to the test and proved its worth by generating high-quality solutions, comparable to the state-of-the-art solvers for simpler variants of TTDP. A test set of 146 instances was used to demonstrate the approach’s effectiveness.

Suggested Citation

  • Kadri Sylejmani & Vigan Abdurrahmani & Arben Ahmeti & Egzon Gashi, 2024. "Solving the tourist trip planning problem with attraction patterns using meta-heuristic techniques," Information Technology & Tourism, Springer, vol. 26(4), pages 633-678, December.
    • Handle: RePEc:spr:infott:v:26:y:2024:i:4:d:10.1007_s40558-024-00297-w
    DOI: 10.1007/s40558-024-00297-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s40558-024-00297-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s40558-024-00297-w?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:spr:infott:v:26:y:2024:i:4:d:10.1007_s40558-024-00297-w. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.