Ant colony optimization using two-dimensional pheromone for single-objective transport problems
Journal of Computational Science(2024)
摘要
One of the acclaimed algorithms that is used to solve combinatorial graph problems is ant colony optimization (ACO). In this article, we focus on a novel extended model of the pheromone that is responsible for storing collective knowledge. The presented two-dimensional pheromone is able to accommodate more information that is extracted from feasible solutions that can be used to improve the search of a solution space. The idea is positively evaluated on TSP and VRP problems, achieving better results as compared to the original algorithm. Since it is a universal concept, it can be applied to any single-objective problem that is solvable by ACO.
更多查看译文
关键词
Ant-colony optimisation,Metaheuristics,Two-dimensional pheromone
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要