.png){kind=icon}
返回
Multi-objective Ant Colony Optimization: Review
.png){kind=icon}
PRE
AI
DOI：10.1007/s11831-024-10178-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Ant colony optimization (ACO) algorithm is one of the most popular swarm-based algorithms inspired by the behavior of an ant colony to find the shortest path for food. The multi-objective ACO (MOACO) is a modified variant of ACO introduced to deal with multi-objective optimization problems (MOPs). The MOACO is seeking to find a set of solutions that achieve trade-offs between the different objectives, which help the decision-makers select the most appreciated solution according to their preferences. Recently, a large number of MOACO research works have been published in the literature, reaching 384 research papers according to the SCOPUS database. In this review paper, 189 different research works of MOACOs published in only scientific journals are considered. Through this research, researchers will gain insights into the expansion of MOACO, the theoretical foundations of MOPs and the MOACO algorithm, various MOACO variants documented in existing literature will be reviewed, and the specific application domains where MOACO has been implemented will be summarized. The critical discussion of the MOACO advantages and limitations is analyzed to provide better insight into the main research gaps in this domain. Finally, the conclusion and some possible future research directions of MOACO are also given in this work.
Keyword:
SHOP SCHEDULING PROBLEM
VEHICLE-ROUTING PROBLEM
OPTIMAL-DESIGN
RESOURCE-ALLOCATION
DISTRIBUTION-SYSTEMS
GENETIC ALGORITHMS
SENSOR NETWORKS
MODEL
TIME
CONSOLIDATION
期刊
IF:
12.1
论文数:
1.8K
被引数:
1.2W
机构
引用论文
Separation of artifacts from electroencephalogram signal using sequential singular spectrum analysis
PREAI
分享收藏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分享收藏
查看更多内容