Practical Route Planning Algorithm

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