Document Type

Article

Publication Date

10-2018

Department

Mathematics

Language

English

Publication Title

Journal of Applied Mathematics

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.

Comments

This published version is made available on Dickinson Scholar with the permission of the publisher. For more information on the published version, visit Hindawi's Website.

© 2018. This publication is made available under the CC-BY-NC-ND 4.0 license: http://creativecommons.org/licenses/by-nc-nd/4.0/.

Open access publication of this article was made possible with grant support from Waidner-Spahr Library distributed through the Dickinson College Research & Development Committee.


DOI

10.1155/2018/2453185

COinS