A Dual-Mode Genetic-Ant Colony Algorithm for Dynamic Path Planning in Smart Scenic Spots

作者：Yao Wang, Bin Zhang · 发表于：Informatica · 年份：2025 · DOI：10.31449/inf.v49i27.10420 · 被引用次数：1 · 研究领域：Robotic Path Planning Algorithms、Evacuation and Crowd Dynamics、Metaheuristic Optimization Algorithms Research

This article focuses on the path planning problem in intelligent tourism scenic areas and innovatively proposes a dual-mode Genetic-Ant Colony Optimization algorithm (GA-ACO). This algorithm cleverly combines the global exploration advantage of genetic algorithms (GA) with the local development expertise of ant colony optimization (ACO), constructing a multi-dimensional dynamic fitness function in real-time that incorporates both visitor preferences and dynamic environmental constraints (such as attraction congestion index and opening status), thereby achieving refined evaluation of path quality. The algorithm facilitates deep collaboration between GA and ACO through the design of pheromone-guided genetic operators (which prioritize high-quality path segments with high pheromone concentrations during selection, crossover, and mutation operations) and a bidirectional feedback mechanism (where elite solutions generated by GA are converted into the initial pheromone matrix for ACO, providing guidance for multi-modal search; the pheromone accumulated by ACO provides local heuristic information for GA), forming a closed-loop enhancement of global exploration and local development. Experiments show that, compared to traditional algorithms (such as pure GA and ACO), GA-ACO significantly outperforms key indicators like path length, number of iterations, and number of turns: the optimal path length is reduced by 6% compared to ACO, the average number of iterations is reduced by 50%, a...