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

Zhang Yang, Jiacheng Li and Lei Li
Additional contact information
Zhang Yang: Department of Information Engineering, Faculty of Science and Engineering, Hosei University, Tokyo 184-8584, Japan
Jiacheng Li: Department of Electrical, Electronics and Information Engineering, Faculty of Engineering, Kanagawa University, Yokohama 221-8686, Japan
Lei Li: Department of Information Engineering, Faculty of Science and Engineering, Hosei University, Tokyo 184-8584, Japan

Mathematics, 2020, vol. 8, issue 12, 1-20

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. The results demonstrate that the parthenogenetic simulated annealing algorithm has better optimization ability than the general parthenogenetic algorithm when the data scale is expanded.

Keywords: tourism planning; theme park problem; routing problem; time-dependent; partheno-genetic algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/8/12/2193/pdf (application/pdf)
https://www.mdpi.com/2227-7390/8/12/2193/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:8:y:2020:i:12:p:2193-:d:459438

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().