Abstract
ABSTRACT Existing ant colony algorithms only have one kind of pheromone. They use non-dominated solutions to update it while not making use of dominated solutions, which can provide valuable information for guiding the subsequent foraging process. To make full use of dominated solutions, we create a new kind of pheromone temporarily called a negative pheromone and propose a new ant colony optimisation algorithm called NMOACO/D, which combines MOEA/D-ACO with the negative pheromone. Many experiments have been carried out in this study to compare NMOACO/D with MOEA/D-ACO and other algorithms on several bi-objective travelling salesman problems. We demonstrate that NMOACO/D outperforms the MOEA/D-ACO and six different recently proposed related algorithms on all nine test instances. We also evaluate the effect of negative pheromone on the performance of the NMOACO/D. The results in this paper show that correctly making use of the information related to dominated solutions can further improve the ant colony algorithm performance.
Sign-in/Register to access full text options 
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 callMore From: Journal of Experimental & Theoretical Artificial Intelligence
Disclaimer: 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.
