Translator Disclaimer
2018 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, Leonard J. Testa
J. Appl. Math. 2018: 1-14 (2018). DOI: 10.1155/2018/2453185

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.

Citation

Download Citation

Elizabeth L. Bouzarth. Richard J. Forrester. Kevin R. Hutson. Rahul Isaac. James Midkiff. Danny Rivers. Leonard J. Testa. "A Comparison of Algorithms for Finding an Efficient Theme Park Tour." J. Appl. Math. 2018 1 - 14, 2018. https://doi.org/10.1155/2018/2453185

Information

Received: 23 August 2018; Accepted: 17 September 2018; Published: 2018
First available in Project Euclid: 16 November 2018

zbMATH: 07051357
MathSciNet: MR3869809
Digital Object Identifier: 10.1155/2018/2453185

Rights: Copyright © 2018 Hindawi

JOURNAL ARTICLE
14 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.2018 • 2018
Back to Top