Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
