Multi-objective Ant Colony Optimization: Review

IF 9.7 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Mohammed A. Awadallah, Sharif Naser Makhadmeh, Mohammed Azmi Al-Betar, Lamees Mohammad Dalbah, Aneesa Al-Redhaei, Shaimaa Kouka, Oussama S. Enshassi
{"title":"Multi-objective Ant Colony Optimization: Review","authors":"Mohammed A. Awadallah, Sharif Naser Makhadmeh, Mohammed Azmi Al-Betar, Lamees Mohammad Dalbah, Aneesa Al-Redhaei, Shaimaa Kouka, Oussama S. Enshassi","doi":"10.1007/s11831-024-10178-4","DOIUrl":null,"url":null,"abstract":"<p>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.\n</p>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":null,"pages":null},"PeriodicalIF":9.7000,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archives of Computational Methods in Engineering","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s11831-024-10178-4","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

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.

Abstract Image

多目标蚁群优化:回顾
蚁群优化(ACO)算法是最流行的基于蚁群的算法之一,其灵感来源于蚁群寻找食物的最短路径的行为。多目标 ACO 算法(MOACO)是 ACO 算法的一种改进型,用于处理多目标优化问题(MOPs)。MOACO 致力于找到一组能在不同目标之间实现权衡的解决方案,从而帮助决策者根据自己的偏好选择最满意的解决方案。最近,文献中发表了大量 MOACO 研究成果,根据 SCOPUS 数据库的统计,研究论文已达 384 篇。在这篇综述论文中,考虑了仅在科学期刊上发表的 189 篇不同的 MOACO 研究作品。通过这项研究,研究人员将深入了解 MOACO 的扩展、澳门威尼斯人线上娱乐场和 MOACO 算法的理论基础,回顾现有文献中记载的各种 MOACO 变体,并总结已实施 MOACO 的具体应用领域。对 MOACO 的优势和局限性进行批判性讨论分析,以便更好地了解该领域的主要研究空白。最后,本文还给出了结论以及 MOACO 未来可能的研究方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
19.80
自引率
4.10%
发文量
153
审稿时长
>12 weeks
期刊介绍: Archives of Computational Methods in Engineering Aim and Scope: Archives of Computational Methods in Engineering serves as an active forum for disseminating research and advanced practices in computational engineering, particularly focusing on mechanics and related fields. The journal emphasizes extended state-of-the-art reviews in selected areas, a unique feature of its publication. Review Format: Reviews published in the journal offer: A survey of current literature Critical exposition of topics in their full complexity By organizing the information in this manner, readers can quickly grasp the focus, coverage, and unique features of the Archives of Computational Methods in Engineering.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信