EUVIMEDEUVIMED entdecken
VergleichsstudieOpen Access · CC BY-NC 4.0

A comparison of three evolutionary algorithms for group scheduling in theme parks with multitype facilities

Yi-Chih Hsieh iD, Peng-Sheng You iD

Science Progress · 2024

DOI: 10.1177/00368504241278424 ↗

Kurz gefasst

Vergleichsstudie in der Zeitschrift Science Progress, 2024. Verfasst von Yi-Chih Hsieh und 1 weiteren Autor:innen. Beteiligte Einrichtung: Department of Industrial Management, National Formosa University, Yunlin, Taiwan. Hauptthemen laut MEDLINE: Algorithms. Die Arbeit nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

During the peak tourist season, large theme parks often experience a simultaneous influx of visitors, resulting in prolonged waiting times for popular attractions. This extended waiting significantly reduces tourists’ satisfaction and may negatively impact their willingness to revisit the theme park. In Taiwan, schools at all levels often plan graduation trips to theme parks for their students. Students are divided into groups and must enter and exit the theme park at the same time. This article presents a new theme park problem with multitype facilities (TPP-MTF) for student groups. Based on the group's preference for theme park facilities, multitype reserved tickets with popular facilities are designed for groups, so groups do not need to wait for the reserved facilities. Since the waiting time for groups can be reduced, the theme park can also obtain ticket fees in advance and estimate the number of visitors to the theme park, so the theme park and the group can achieve a win–win situation. This article proposes a new decoding approach for a random permutation of integer sequence and embeds it into an immune-based algorithm, genetic algorithm, and particle swarm optimization algorithm to solve the TPP-MTF problem. A theme park in Taiwan was taken as an example and numerical results of the three algorithms were analyzed and compared to verify the effectiveness of the proposed algorithms.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsHumansTaiwanParks, RecreationalTourismStudents

Stichwörter der Autor:innen

Theme parkdecodingevolutionary algorithmgroup tripmultitype facilityoptimization

Autor:innen und Institutionen

  • Department of Industrial Management, National Formosa University, Yunlin, Taiwan.
  • Department of Business Administration, National ChiaYi University, ChiaYi, Taiwan.

ORCID-Profile: Yi-Chih Hsieh, Peng-Sheng You

Zitieren

APA

Hsieh, Y. C., & You, P. S. (2024). A comparison of three evolutionary algorithms for group scheduling in theme parks with multitype facilities. Science Progress. https://doi.org/10.1177/00368504241278424

Vancouver

Hsieh YC, You PS. A comparison of three evolutionary algorithms for group scheduling in theme parks with multitype facilities. Science Progress. 2024. doi:10.1177/00368504241278424

BibTeX
@article{Hsieh2024,
  author = {Hsieh, Yi-Chih and You, Peng-Sheng},
  title = {A comparison of three evolutionary algorithms for group scheduling in theme parks with multitype facilities},
  journal = {Science Progress},
  year = {2024},
  doi = {10.1177/00368504241278424}
}
Kostenlos starten →