© 2019 Association for Computing Machinery.As the remarkable improvement of people’s living levels and interesting for entertainment, the theme park has become one of the most popular places for people to enjoy life. However, since the high popularity of theme parks, based on the reality circumstance of tourists, enjoying more attraction projects and decreasing the fatigue greatly can largely improve the satisfaction of tourists. Therefore, based on the network of Traveling Salesman Problem (TSP), we propose a time-dependent theme park routing problem where the walking time is time-dependent under the consideration of congestion and fatigue degree. The primary objectives are to maximize the number of visited attractions, satisfaction and minimize the queuing time and walking time. In this study, the general model for time-dependent theme park problem is formulated and the partheno-genetic algorithm is used to solve the model.
https://doi.org/10.1145/3338840.3355644Cite as:
@inproceedings{Zhang_2019,
doi = {10.1145/3338840.3355644},
url = {https://doi.org/10.1145%2F3338840.3355644},
year = 2019,
month = {sep},
publisher = {{ACM}},
author = {Yang Zhang and Jiacheng Li and Jiaoman Du and Lei Li},
title = {Time-dependent theme park routing problem},
booktitle = {Proceedings of the Conference on Research in Adaptive and Convergent Systems}
}