Next Article in Journal
A Family of Multiple-Root Finding Iterative Methods Based on Weight Functions
Next Article in Special Issue
An Intelligent Algorithm for Solving the Efficient Nash Equilibrium of a Single-Leader Multi-Follower Game
Previous Article in Journal
Learning Medical Image Denoising with Deep Dynamic Residual Attention Network
Previous Article in Special Issue
Exploitation of a Productive Asset in the Presence of Strategic Behavior and Pollution Externalities
Article

Time-Dependent Theme Park Routing Problem by Partheno-Genetic Algorithm

by 1,*, 2 and 1
1
Department of Information Engineering, Faculty of Science and Engineering, Hosei University, Tokyo 184-8584, Japan
2
Department of Electrical, Electronics and Information Engineering, Faculty of Engineering, Kanagawa University, Yokohama 221-8686, Japan
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(12), 2193; https://doi.org/10.3390/math8122193
Received: 24 September 2020 / Revised: 30 November 2020 / Accepted: 2 December 2020 / Published: 9 December 2020
(This article belongs to the Special Issue Mathematical Game Theory 2021)
With the improvement of people’s living standards and entertainment interests, theme parks have become one of the most popular holiday places. Many theme park websites provide a variety of information, according to which tourists can arrange their own schedules. However, most theme park websites usually have too much information, which makes it difficult for tourists to develop a tourism planning. Therefore, the theme park routing problem has attracted the attention of scholars. Based on the Traveling Salesman Problem (TSP) network, we propose a Time-Dependent Theme Park Routing Problem (TDTPRP), in which walking time is time-dependent, considering the degree of congestion and fatigue. The main goal is to maximize the number of attractions visited and satisfaction and to reduce queues and walking time. To verify the feasibility and the effectiveness of the model, we use the Partheno-Genetic Algorithm (PGA) and an improved Annealing Partheno-Genetic Algorithm (APGA) to solve the model in this paper. Then, in the experimental stage, we conducted two experiments, and the experimental data were divided into real-world problem instances and randomly generated problem instances. The results demonstrate that the parthenogenetic simulated annealing algorithm has better optimization ability than the general parthenogenetic algorithm when the data scale is expanded. View Full-Text
Keywords: tourism planning; theme park problem; routing problem; time-dependent; partheno-genetic algorithm tourism planning; theme park problem; routing problem; time-dependent; partheno-genetic algorithm
Show Figures

Figure 1

MDPI and ACS Style

Yang, Z.; Li, J.; Li, L. Time-Dependent Theme Park Routing Problem by Partheno-Genetic Algorithm. Mathematics 2020, 8, 2193. https://doi.org/10.3390/math8122193

AMA Style

Yang Z, Li J, Li L. Time-Dependent Theme Park Routing Problem by Partheno-Genetic Algorithm. Mathematics. 2020; 8(12):2193. https://doi.org/10.3390/math8122193

Chicago/Turabian Style

Yang, Zhang, Jiacheng Li, and Lei Li. 2020. "Time-Dependent Theme Park Routing Problem by Partheno-Genetic Algorithm" Mathematics 8, no. 12: 2193. https://doi.org/10.3390/math8122193

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop