Practical Route Planning Algorithm
Abstract
Routing algorithms are traditionally considered to apply thesum of profits gathered at visited locations as an objectivefunction since the Traveling Salesman Problem. This heritagedisregards many practical considerations, hence the result ofthese models meet with user’s needs rarely.Thus considering the importance of this theoretical and modelingproblem, a novel objective function will be presented inthis paper as an extension of the one inherited from the TSPthat is more aligned with user preferences and aims to maximizethe tourist’s satisfaction. We also propose a heuristicalgorithm to solve the Team Orienteering Problem with relativelylow computation time in case of high number of verticeson the graph and multiple tour days. Based on the key performanceindicators and user feedback the algorithm is suitableto be implemented in a GIS application considering that even a3-day tour is designed less than 4 seconds.
Keywords:
Team Orienteering Problem, Route Planning, Heuristic Algorithm, Tourism JEL code, C60, C61, Z32Published Online
How to Cite
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (see The Effect of Open Access). As soon as the paper is accepted, finally submitted and edited, the paper will appear in the "OnlineFirst" page of the journal, thus from this point no other internet-based publication is necessary.

