A Comparison of Algorithms for Finding an Efficient Theme Park Tour

Elizabeth L. Bouzarth, Richard J. Forrester, Kevin R. Hutson, Rahul Isaac, James Midkiff, Danny Rivers and Leonard J. Testa

Journal of Applied Mathematics, 2018, vol. 2018, issue 1

Abstract: The problem of efficiently touring a theme park so as to minimize the amount of time spent in queues is an instance of the Traveling Salesman Problem with Time‐Dependent Service Times (TSP‐TS). In this paper, we present a mixed‐integer linear programming formulation of the TSP‐TS and describe a branch‐and‐cut algorithm based on this model. In addition, we develop a lower bound for the TSP‐TS and describe two metaheuristic approaches for obtaining good quality solutions: a genetic algorithm and a tabu search algorithm. Using test instances motivated by actual theme park data, we conduct a computational study to compare the effectiveness of our algorithms.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2018/2453185

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:wly:jnljam:v:2018:y:2018:i:1:n:2453185

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().