Ant Colony Optimization for Tourist Route Planning
- Authors
- Xu, Li-Ting; Yang, Qiang; Lin, Xin; Qu, Cheng-Zhi; Lu, Zhen-Yu; Duan, Dan-Ting; Zhang, Jun
- Issue Date
- Jul-2025
- Publisher
- Association for Computing Machinery, Inc
- Keywords
- ant colony optimization; combinational optimization; constrained optimization; tourist route planning
- Citation
- GECCO 2025 - Proceedings of the 2025 Genetic and Evolutionary Computation Conference, pp 349 - 357
- Pages
- 9
- Indexed
- SCOPUS
- Journal Title
- GECCO 2025 - Proceedings of the 2025 Genetic and Evolutionary Computation Conference
- Start Page
- 349
- End Page
- 357
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/126380
- DOI
- 10.1145/3712256.3726341
- Abstract
- This paper develops a new Tourist Route Planning (TRP) model by incorporating the entrance fees and the experience values of scenic spots, the travelling costs between scenic spots, and the budget of the tourist. Resultantly, the new TRP aims at finding an optimal route by maximizing the travelling experience value of the tourist with the constraint that the total cost of the route including the travelling costs and the spot entrance fees does not exceed the given budget. To effectively solve this new TRP, this paper adapts the five classical ant colony optimization algorithms (ACO), namely ant system (AS), elite AS (EAS), rank-based AS (RAS), max-min AS (MMAS), and ant colony system (ACS). To this end, this paper first introduces a new heuristic information measure by integrating the experience values and the entrance fees of the scenic spots, and the traveling costs between scenic spots. Further, a new local search strategy encompassing 2-opt and one spot insertion operator is designed to further improve the quality of the route under the budget constraint. Abundant experiments have been carried out on various TRP instances of three scales, namely small-scale, medium-scale, and large-scale, involving different numbers of scenic spots and different settings of budgets. The experimental results demonstrate that all the adapted five ACO algorithms are very effective for addressing the new TRP. Among them, RAS performs the best on small-scale TRP instances, and ACS obtains the best results on medium-scale TRP instances, while MMAS is the most effective one in addressing large-scale TRP instances. © 2025 Copyright is held by the owner/author(s). Publication rights licensed to ACM.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.