mathematics Article Time-Dependent Theme Park Routing Problem by Partheno-Genetic Algorithm Zhang Yang 1,* , Jiacheng Li 2 and Lei Li 1 1 Department of Information Engineering, Faculty of Science and Engineering, Hosei University, Tokyo 184-8584, Japan;
[email protected] 2 Department of Electrical, Electronics and Information Engineering, Faculty of Engineering, Kanagawa University, Yokohama 221-8686, Japan;
[email protected] * Correspondence:
[email protected]; Tel.: +81-70-4134-6022 Received: 24 September 2020; Accepted: 2 December 2020; Published: 9 December 2020 Abstract: 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.