hrcak mascot   Srce   HID

Original scientific paper

Evolving Efficient Theme Park Tours

Leonard Testa ; North Carolina A &T State University, Greensboro, North Carolina, USA
Albert C. Esterline ; North Carolina A &T State University, Greensboro, North Carolina, USA
Gerry V. Dozier ; Department of Computer Science and Engineering, Auburn University, Alabama, USA

Fulltext: english, pdf (8 MB) pages 77-92 downloads: 112* cite
APA 6th Edition
Testa, L., Esterline, A.C. & Dozier, G.V. (1999). Evolving Efficient Theme Park Tours. Journal of computing and information technology, 7 (1), 77-92. Retrieved from https://hrcak.srce.hr/150201
MLA 8th Edition
Testa, Leonard, et al. "Evolving Efficient Theme Park Tours." Journal of computing and information technology, vol. 7, no. 1, 1999, pp. 77-92. https://hrcak.srce.hr/150201. Accessed 18 Aug. 2019.
Chicago 17th Edition
Testa, Leonard, Albert C. Esterline and Gerry V. Dozier. "Evolving Efficient Theme Park Tours." Journal of computing and information technology 7, no. 1 (1999): 77-92. https://hrcak.srce.hr/150201
Harvard
Testa, L., Esterline, A.C., and Dozier, G.V. (1999). 'Evolving Efficient Theme Park Tours', Journal of computing and information technology, 7(1), pp. 77-92. Available at: https://hrcak.srce.hr/150201 (Accessed 18 August 2019)
Vancouver
Testa L, Esterline AC, Dozier GV. Evolving Efficient Theme Park Tours. Journal of computing and information technology [Internet]. 1999 [cited 2019 August 18];7(1):77-92. Available from: https://hrcak.srce.hr/150201
IEEE
L. Testa, A.C. Esterline and G.V. Dozier, "Evolving Efficient Theme Park Tours", Journal of computing and information technology, vol.7, no. 1, pp. 77-92, 1999. [Online]. Available: https://hrcak.srce.hr/150201. [Accessed: 18 August 2019]

Abstracts
In this paper, we describe the use of an evolutionary algorithm (EA) for the problem of visiting rides in a theme park. Generating a tour of the rides in a theme park is an instance of the time dependent traveling salesman problem (TDTSP) in which the cost of visiting any two rides depends not only on the distance between the rides, but also the time to wait in line and ride each ride. We describe the implementation of the evolutionary algorithm, including EA's ability to satisfy the constraint of scheduling lunch in the theme park. We present several test problems and compare both the running times and costs of tours generated by the EA to those of a previously described dynamic programming heuristic.

Keywords
evolutionary algorithms

Hrčak ID: 150201

URI
https://hrcak.srce.hr/150201

Visits: 164 *