.png){kind=icon}
.png){kind=icon}
Return
Ant colony optimization using two-dimensional pheromone for single-objective transport problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jocs.2024.102308.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Ant-colony optimization
Metaheuristics
Two-dimensional pheromone
Journal
IF:
18.3
Papers:
3.1K
Citations:
4.0K