Journal of Applied Mathematics
- J. Appl. Math.
- Volume 2018 (2018), Article ID 2453185, 14 pages.
A Comparison of Algorithms for Finding an Efficient Theme Park Tour
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.
J. Appl. Math., Volume 2018 (2018), Article ID 2453185, 14 pages.
Received: 23 August 2018
Accepted: 17 September 2018
First available in Project Euclid: 16 November 2018
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Bouzarth, Elizabeth L.; Forrester, Richard J.; Hutson, Kevin R.; Isaac, Rahul; Midkiff, James; Rivers, Danny; Testa, Leonard J. A Comparison of Algorithms for Finding an Efficient Theme Park Tour. J. Appl. Math. 2018 (2018), Article ID 2453185, 14 pages. doi:10.1155/2018/2453185. https://projecteuclid.org/euclid.jam/1542337253