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

Gulcin Dinc Yalcin (), Hilal Malta and Seher Saylik
Additional contact information
Gulcin Dinc Yalcin: Eskisehir Technical University
Hilal Malta: Eskisehir Technical University
Seher Saylik: Eskisehir Technical University

OPSEARCH, 2023, vol. 60, issue 4, No 5, 1703-1730

Abstract: 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.

Keywords: Tourist trip design problem; Heuristic algorithm; Time windows; Mobile application; Mixed-integer programming (search for similar items in EconPapers)
JEL-codes: C61 C63 C88 Z30 (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-023-00678-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:60:y:2023:i:4:d:10.1007_s12597-023-00678-5

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-023-00678-5

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().