.png){kind=icon}
返回
A decomposition-based many-objective ant colony optimization algorithm with adaptive solution construction and selection approaches
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2021.100977.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The ant colony optimization algorithm (ACO) had an exceptional performance in solving discrete optimization problems because of its design in solution construction and search strategy. However, the study of ACO in discrete many-objective optimization remains insufficient. This paper proposes a decomposition-based ACO for discrete many-objective optimization. The proposed algorithm utilizes a reinforcement learning-based adaptive pheromone updating strategy that enhances the solution construction phase's searching ability in the high dimensional objective space. Furthermore, an adaptive selection strategy is adopted to improve its convergence performance using different reference points. And A comparative experimental study is conducted on many objective benchmark test cases. The experimental results indicate that the proposed algorithm achieves competitive performance on optimization quality.
Keyword:
Ant colony optimization
Many-objective optimization
Discrete optimization
Decomposition strategy
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
Ant Colony Optimization Based Memetic Algorithm to Solve Bi-Objective Multiple Traveling Salesmen Problem for Multi-Robot Systems.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏Power Performance Verification of a Wind Turbine by using the Wilcoxon Signed-Rank Test基于Wilcoxon符号秩检验的风电机组功率性能验证
PREAI
分享收藏分享收藏
查看更多内容