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 [Article]

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.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

0Downloads

6 month trend

559Hits

Additional statistics are available via IRStats2.