An ant colony optimization algorithm based on mutation and dynamic pheromone updating

Zhu, Qingbao and Yang, Zhijun ORCID: https://orcid.org/0000-0003-2615-4297 (2004) An ant colony optimization algorithm based on mutation and dynamic pheromone updating. Journal of Software, 15 (2). pp. 185-192. ISSN 1000-9825

Full text is not in this repository.

Abstract

Despite the numerous applications of ACO (ant colony optimization) algorithm in optimization computation, it remains a computational bottleneck that the ACO algorithm costs too much time in order to find an optimal solution for large-scaled optimization problems. Therefore, a quickly convergent version of the ACO algorithm is presented. A novel strategy based on the dynamic pheromone updating is adopted to ensure that every ant contributes to the search during each search step. Meanwhile, a unique mutation scheme is employed to optimize the search results of each step. The computer experiments demonstrate that the proposed algorithm makes the speed of convergence hundreds of times faster than the latest improved ACO algorithm.

Item Type: Article
Research Areas: A. > School of Science and Technology > Design Engineering and Mathematics
Item ID: 9914
Useful Links:
Depositing User: Zhijun Yang
Date Deposited: 12 Feb 2013 05:11
Last Modified: 01 Aug 2019 07:50
URI: https://eprints.mdx.ac.uk/id/eprint/9914

Actions (login required)

Edit Item Edit Item