IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v60y2023i4d10.1007_s12597-023-00678-5.html
   My bibliography  Save this article

A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application

Author

Listed:
  • Gulcin Dinc Yalcin

    (Eskisehir Technical University)

  • Hilal Malta

    (Eskisehir Technical University)

  • Seher Saylik

    (Eskisehir Technical University)

Abstract

The tourist trip design problem (TTDP) is about to generate routes for tourists to maximize the points of interest (POIs) visited within specific time windows. In this study, new constraints: budget, weather and break are considered. First, the budget is required for entrance fees and the distance between two points where a taxi has to be used. Additionally, the expense of the break was taken into account. Then, the weather was considered for summer and for other seasons. On a summer day, tourists are likely to prefer visiting POIs, which are indoor areas, between specific times e.g. 11 a.m. to 3 p.m. to protect against the side effects of the sun. Furthermore, tourists need to take a break to relax during the trip. A mathematical model of the TTDP with these new constraints (TTDP-BWB) was developed. Then, a heuristic algorithm was developed with a new defined function that took the new constraints into account. The algorithm was codded using Android Studio and developed a mobile application for the case of Eskisehir in Türkiye. Problems are generated on the small and medium scale for the case of Eskisehir and used large-scale problems from published literature. The results of the algorithm were compared with the results of the mathematical model for the small scale problems. Additional, large-scale problems from literature were solved to see the performance of the heuristic algorithm. Computational results showed that the algorithm is promising.

Suggested Citation

  • Gulcin Dinc Yalcin & Hilal Malta & Seher Saylik, 2023. "A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application," OPSEARCH, Springer;Operational Research Society of India, vol. 60(4), pages 1703-1730, December.
    • Handle: RePEc:spr:opsear:v:60:y:2023:i:4:d:10.1007_s12597-023-00678-5
    DOI: 10.1007/s12597-023-00678-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-023-00678-5
    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/s12597-023-00678-5?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.

    More about this item

    Keywords

    Tourist trip design problem; Heuristic algorithm; Time windows; Mobile application; Mixed-integer programming;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
    • C88 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs - - - Other Computer Software
    • Z30 - Other Special Topics - - Tourism Economics - - - General

    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:spr:opsear:v:60:y:2023:i:4:d:10.1007_s12597-023-00678-5. 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.