Journal of Applied Mathematics

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

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

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.

Article information

Source
J. Appl. Math., Volume 2018 (2018), Article ID 2453185, 14 pages.

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

Permanent link to this document
https://projecteuclid.org/euclid.jam/1542337253

Digital Object Identifier
doi:10.1155/2018/2453185

Mathematical Reviews number (MathSciNet)
MR3869809

Citation

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


Export citation

References

  • B. Guides, Birnbaum's 2019 Walt Disney World: The Official Guide, Birnbaum Guides, 2018.
  • B. Sehlinger and L. Testa, Unofficial Guide to Walt Disney World 2019, Unofficial Guides, 2019.
  • D. Tas, M. Gendreau, O. Jabali, and G. Laporte, “The traveling salesman problem with time-dependent service times,” European Journal of Operational Research, vol. 248, no. 2, pp. 372–383, 2016.
  • K. Fox, B. Gavish, and S. Graves, The Time Dependent Traveling Salesman Problem and Extensions, vol. 7904, Graduate School of Management, University of Rochester, 1979.
  • J.-C. Picard and M. Queyranne, “The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling,” Operations Research, vol. 26, no. 1, pp. 86–110, 1978.
  • N. Balakrishnan, A. Lucena, and R. T. Wong, “Scheduling examinations to reduce second-order conflicts,” Computers & Operations Research, vol. 19, no. 5, pp. 353–361, 1992.
  • F. Jaehn and H. A. Sedding, “Scheduling with time-dependent discrepancy times,” Journal of Scheduling, vol. 19, no. 6, pp. 737–757, 2016.
  • E. Angelelli, M. Gendreau, R. Mansini, and M. Vindigni, “The traveling purchaser problem with time-dependent quantities,” Computers & Operations Research, vol. 82, pp. 15–26, 2017.
  • B. Fleischmann, M. Gietz, and S. Gnutzmann, “Time-varying travel times in vehicle routing,” Transportation Science, vol. 38, no. 2, pp. 160–173, 2004.
  • M. Gendreau, G. Ghiani, and E. Guerriero, “Time-dependent routing problems: A review,” Computers & Operations Research, vol. 64, pp. 189–197, 2015.
  • A. Haghani and S. Jung, “A dynamic vehicle routing problem with time-dependent travel times,” Computers & Operations Research, vol. 32, no. 11, pp. 2959–2986, 2005.
  • C. Malandraki and M. S. Daskin, “Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms,” Transportation Science, vol. 26, no. 3, pp. 185–200, 1992.
  • S. Mancini, “A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times,” Computers & Operations Research, vol. 88, pp. 290–296, 2017.
  • J.-Y. Potvin, Y. Xu, and I. Benyahia, “Vehicle routing and scheduling with dynamic travel times,” Computers & Operations Research, vol. 33, no. 4, pp. 1129–1137, 2006.
  • R. Spliet, S. Dabia, and T. Van Woensel, “The time window assignment vehicle routing problem with time-dependent travel times,” Transportation Science, vol. 52, no. 2, pp. 261–276, 2018.
  • R. J. V. Wiel and N. V. Sahinidis, “Heuristic bounds and test problem generation for the time-dependent traveling salesman problem,” Transportation Science, vol. 29, no. 2, pp. 167–183, 1995.
  • R. J. V. Wiel and N. V. Sahinidis, “An exact solution approach for the time-dependent traveling-salesman problem,” Naval Research Logistics (NRL), vol. 43, no. 6, pp. 797–820, 1996.
  • A. Montero, I. Mndez-Daz, and J. J. Miranda-Bront, “An integer programming approach for the time-dependent traveling salesman problem with time windows,” Computers & Operations Research, vol. 88, pp. 280–289, 2017.
  • J.-F. Cordeau, G. Ghiani, and E. Guerriero, “Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem,” Transportation Science, vol. 48, no. 1, pp. 46–58, 2014.
  • S. Ichoua, M. Gendreau, and J. Potvin, “Vehicle dispatching with time-dependent travel times,” European Journal of Operational Research, vol. 144, no. 2, pp. 379–396, 2003.
  • C. Malandraki and R. B. Dial, “A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem,” European Journal of Operational Research, vol. 90, no. 1, pp. 45–55, 1996.
  • J. Schneider, “The time-dependent traveling salesman problem,” Physica A: Statistical Mechanics and Its Applications, vol. 314, no. 1-4, pp. 151–155, 2002.
  • Y. Xiao and A. Konak, “A simulating annealing algorithm to solve the green vehicle routing & scheduling problem with hierarchical objectives and weighted tardiness,” Applied Soft Computing, vol. 34, pp. 372–388, 2015.
  • J. Bentner, G. O. G. Bauer, I. Morgenstern, and J. Schneider, “Optimization of the time-dependent traveling salesman problem with monte carlo methods,” Physical Review E, 2001.
  • B. Golden, S. Raghavan, and E. Wasil, Solving the Time Dependent Traveling Salesman Problem, vol. 29, Springer US, 2005.
  • L. Testa, A. Esterline, G. Dozier, and A. Homaifar, “A comparison of operators for solving time-dependent traveling salesman problems using genetic algorithms,” GECCO, pp. 995–1102, 2000.
  • A. Lucena, “Time-dependent traveling salesman problem–-the deliveryman case,” Networks, vol. 20, no. 6, pp. 753–763, 1990.
  • G. Stecco, J.-F. Cordeau, and E. Moretti, “A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times,” Computers & Operations Research, vol. 35, no. 8, pp. 2635–2655, 2008.
  • https://touringplans.com/.
  • C. E. Miller, A. W. Tucker, and R. A. Zemlin, “Integer programming formulation of traveling salesman problems,” Journal of the ACM, vol. 7, pp. 326–329, 1960.
  • G. Dantzig, R. Fulkerson, and S. Johnson, “Solution of a large-scale traveling-salesman problem,” Journal of the Operations Research Society of America, vol. 2, no. 4, pp. 393–410, 1954.
  • M. Stoer and F. Wagner, “A simple min-cut algorithm,” Journal of the ACM, vol. 44, no. 4, pp. 585–591, 1997.
  • Á. E. Eiben, R. Hinterding, and Z. Michalewicz, “Parameter control in evolutionary algorithms,” IEEE Transactions on Evolutionary Computation, vol. 3, no. 2, pp. 124–141, 1999.
  • H. Tamaki, H. Kita, N. Shimizu, K. Maekawa, and Y. Nishikawa, “Comparison study of genetic codings for the Traveling salesman problem,” in Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2), pp. 1–6, June 1994.
  • S. Lin and B. W. Kernighan, “An effective heuristic algorithm for the traveling-salesman problem,” Operations Research, vol. 21, pp. 498–516, 1973.
  • L. Davis, Ed., Handbook of, Genetic Algorithms, Von Hostrand Reinhold, 1991.
  • D. E. Goldberg, “Genetic algorithms in search, optimization, and machine learning,” Choice Reviews Online, vol. 27, no. 02, pp. 27-0936–27-0936, 1989.
  • D. Whitely, T. Starkweather, and D. Fuquay, “Scheduling problems and traveling salesman: The genetic edge recombination operator,” in Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaugmann, pp. 133–140, 1989.
  • F. Glover, “A template for scatter search and path relinking,” in Artificial Evolution, vol. 1363 of Lecture Notes in Computer Science, pp. 1–51, Springer, Berlin, Germany, 1998.
  • F. Glover, “Future paths for integer programming and links to artificial intelligence,” Computers & Operations Research, vol. 13, no. 5, pp. 533–549, 1986.
  • “Tabu search - part 1,” ORSA Journal on Computing, vol. 4, pp. 190–206, 1989.
  • “Tabu search - part 2,” ORSA Journal on Computing, vol. 2, pp. 4–32, 1989.
  • F. Glover and M. Laguna, “Tabu search,” in Handbook of combinatorial optimization, Vol. 3, pp. 621–757, Kluwer Acad. Publ., Boston, MA, 1998.
  • G. Stecco, J.-F. Cordeau, and E. Moretti, “A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine,” Journal of Scheduling, vol. 12, no. 1, pp. 3–16, 2009.
  • É. Taillard, “Parallel iterative search methods for vehicle routing problems,” Networks, vol. 23, no. 8, pp. 661–673, 1993. \endinput