.png){kind=icon}
Return
Adaptive Multimodal Continuous Ant Colony Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2016.2591064.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Seeking multiple optima simultaneously, which multimodal optimization aims at, has attracted increasing attention but remains challenging. Taking advantage of ant colony optimization (ACO) algorithms in preserving high diversity, this paper intends to extend ACO algorithms to deal with multimodal optimization. First, combined with current niching methods, an adaptive multimodal continuous ACO algorithm is introduced. In this algorithm, an adaptive parameter adjustment is developed, which takes the difference among niches into consideration. Second, to accelerate convergence, a differential evolution mutation operator is alternatively utilized to build base vectors for ants to construct new solutions. Then, to enhance the exploitation, a local search scheme based on Gaussian distribution is self-adaptively performed around the seeds of niches. Together, the proposed algorithm affords a good balance between exploration and exploitation. Extensive experiments on 20 widely used benchmark multimodal functions are conducted to investigate the influence of each algorithmic component and results are compared with several state-of-the-art multimodal algorithms and winners of competitions on multimodal optimization. These comparisons demonstrate the competitive efficiency and effectiveness of the proposed algorithm, especially in dealing with complex problems with high numbers of local optima.
Keywords:
Ant colony optimization (ACO)
multimodal optimization
multiple global optima
niching
Journal
IF:
12
Papers:
1.9K
Citations:
2.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveExploratory Landscape Analysis of Continuous Space Optimization Problems Using Information Content
PREAI
ShareSaveShareSaveShareSaveShareSave
View more