On the behavior of pheromone trial in ACO method and novel algorithms
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/27/3/490Abstract
Ant colony optimization (ACO) is a kind of randomized search heuristic method for solving NP-hard problems of combinatorial optimization. Experiment results have shown that these algorithms outperform other nature-inspired algorithms such that simulated annealing, genetic algorithm ect... This paper presents mathematical analysis on behavior of pheromone trail in two most popular ACO algorithms: ACS (Ant Colony System) and MMAS (Max-Min Ant System), then, suggest new ideas for improving pheromone update rules.
Metrics
Downloads
Published
How to Cite
Issue
Section
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.