Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 169, Issue -, Pages -Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2022.108308
Keywords
Path planning; Pheromone prediction; Quantum Mechanism; Ito Integral; Ant Colony Optimization; Parallel algorithm
Funding
- Basic Science Research Program
- Priority Research Centers Program through the National Research Foundation of Korea (NRF) - Ministry of Education, Science and Technology [NRF-2021R1A2C1008647, 2018R1A6A1A03024003]
Ask authors/readers for more resources
This study combines existing metaheuristic algorithms with a prediction method to solve the path planning problem. By modifying the ant colony optimization algorithm and using predicted pheromone traits, the efficiency of the algorithm is improved.
Path planning in a complex network is a traditional and important research area in the optimization and machine learning fields. Several metaheuristics have been proposed; however, they are limited by the number of iterations, limited resources, and computation times. Therefore, in this study, the above issue is solved by integrating the existing metaheuristic algorithm with a prediction method. As a metaheuristic algorithm, ant colony optimization (ACO) is modified and applied. Instead of modeling ants pursuing higher pheromone densities, the proposed framework predicts pheromone traits using the intermediate pheromone density. As the pheromone volumes in the intermediate stage fluctuate, they are modeled using a quantum mechanism. Thereafter, the following pheromone traits are estimated using the modeled stochastic differential equation and Ito integral. The predicted pheromones are used for the parameters in the subsequent ACO iterations. To demonstrate the effectiveness of the proposed framework, the shortest path generation in several large-scale networks is provided. The proposed framework is considered a highly efficient metaheuristic framework with the integration of quantum mechanism-based prediction and existing metaheuristics.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available