逃生:基于人群疏散行为的优化方法

IF 10.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Artificial Intelligence Review Pub Date : 2024-11-16 DOI:10.1007/s10462-024-11008-6
Kaichen Ouyang, Shengwei Fu, Yi Chen, Qifeng Cai, Ali Asghar Heidari, Huiling Chen
{"title":"逃生:基于人群疏散行为的优化方法","authors":"Kaichen Ouyang,&nbsp;Shengwei Fu,&nbsp;Yi Chen,&nbsp;Qifeng Cai,&nbsp;Ali Asghar Heidari,&nbsp;Huiling Chen","doi":"10.1007/s10462-024-11008-6","DOIUrl":null,"url":null,"abstract":"<div><p>Meta-heuristic algorithms, particularly those based on swarm intelligence, are highly effective for solving black-box optimization problems. However, maintaining a balance between exploration and exploitation within these algorithms remains a significant challenge. This paper introduces a useful algorithm, called Escape or Escape Algorithm (ESC), inspired by crowd evacuation behavior, to solve real-world cases and benchmark problems. The ESC algorithm simulates the behavior of crowds during the evacuation, where the population is divided into calm, herding, and panic groups during the exploration phase, reflecting different levels of decision-making and emotional states. Calm individuals guide the crowd toward safety, herding individuals imitate others in less secure areas, and panic individuals make volatile decisions in the most dangerous zones. As the algorithm transitions into the exploitation phase, the population converges toward optimal solutions, akin to finding the safest exit. The effectiveness of the ESC algorithm is validated on two adjustable problem size test suites, CEC 2017 and CEC 2022. ESC ranked first in the 10-dimensional, 30-dimensional tests of CEC 2017, and the 10-dimensional and 20-dimensional tests of CEC 2022, and second in the 50-dimensional and 100-dimensional tests of CEC 2017. Additionally, ESC performed exceptionally well, ranking first in the engineering problems of pressure vessel design, tension/compression spring design, and rolling element bearing design, as well as in two 3D UAV path planning problems, demonstrating its efficiency in solving real-world complex problems, particularly complex problems like 3D UAV path planning. Compared with 12 other high-performance, classical, and advanced algorithms, ESC exhibited superior performance in complex optimization problems. The source codes of ESC algorithm will be shared at https://aliasgharheidari.com/ESC.html and other websites.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"58 1","pages":""},"PeriodicalIF":10.7000,"publicationDate":"2024-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-024-11008-6.pdf","citationCount":"0","resultStr":"{\"title\":\"Escape: an optimization method based on crowd evacuation behaviors\",\"authors\":\"Kaichen Ouyang,&nbsp;Shengwei Fu,&nbsp;Yi Chen,&nbsp;Qifeng Cai,&nbsp;Ali Asghar Heidari,&nbsp;Huiling Chen\",\"doi\":\"10.1007/s10462-024-11008-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Meta-heuristic algorithms, particularly those based on swarm intelligence, are highly effective for solving black-box optimization problems. However, maintaining a balance between exploration and exploitation within these algorithms remains a significant challenge. This paper introduces a useful algorithm, called Escape or Escape Algorithm (ESC), inspired by crowd evacuation behavior, to solve real-world cases and benchmark problems. The ESC algorithm simulates the behavior of crowds during the evacuation, where the population is divided into calm, herding, and panic groups during the exploration phase, reflecting different levels of decision-making and emotional states. Calm individuals guide the crowd toward safety, herding individuals imitate others in less secure areas, and panic individuals make volatile decisions in the most dangerous zones. As the algorithm transitions into the exploitation phase, the population converges toward optimal solutions, akin to finding the safest exit. The effectiveness of the ESC algorithm is validated on two adjustable problem size test suites, CEC 2017 and CEC 2022. ESC ranked first in the 10-dimensional, 30-dimensional tests of CEC 2017, and the 10-dimensional and 20-dimensional tests of CEC 2022, and second in the 50-dimensional and 100-dimensional tests of CEC 2017. Additionally, ESC performed exceptionally well, ranking first in the engineering problems of pressure vessel design, tension/compression spring design, and rolling element bearing design, as well as in two 3D UAV path planning problems, demonstrating its efficiency in solving real-world complex problems, particularly complex problems like 3D UAV path planning. Compared with 12 other high-performance, classical, and advanced algorithms, ESC exhibited superior performance in complex optimization problems. The source codes of ESC algorithm will be shared at https://aliasgharheidari.com/ESC.html and other websites.</p></div>\",\"PeriodicalId\":8449,\"journal\":{\"name\":\"Artificial Intelligence Review\",\"volume\":\"58 1\",\"pages\":\"\"},\"PeriodicalIF\":10.7000,\"publicationDate\":\"2024-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s10462-024-11008-6.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Artificial Intelligence Review\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10462-024-11008-6\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-024-11008-6","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

元启发式算法,尤其是基于蜂群智能的算法,对于解决黑箱优化问题非常有效。然而,在这些算法中保持探索与开发之间的平衡仍然是一个重大挑战。本文受人群疏散行为的启发,介绍了一种有用的算法,名为 "逃离或逃逸算法(ESC)",用于解决现实世界中的案例和基准问题。ESC算法模拟了人群在疏散过程中的行为,在探索阶段,人群被分为冷静组、羊群组和恐慌组,反映了不同的决策水平和情绪状态。冷静的个体会引导人群走向安全地带,群居的个体会在不太安全的区域模仿其他人,而恐慌的个体则会在最危险的区域做出不稳定的决定。当算法过渡到开发阶段时,人群会向最优解靠拢,类似于寻找最安全的出口。ESC算法的有效性在两个可调整问题规模的测试套件(CEC 2017和CEC 2022)上得到了验证。ESC在CEC 2017的10维、30维测试和CEC 2022的10维、20维测试中排名第一,在CEC 2017的50维、100维测试中排名第二。此外,ESC表现优异,在压力容器设计、拉伸/压缩弹簧设计、滚动轴承设计等工程问题以及两个三维无人机路径规划问题中均排名第一,展示了其解决现实世界复杂问题,尤其是三维无人机路径规划等复杂问题的高效性。与其他 12 种高性能、经典和先进算法相比,ESC 算法在复杂优化问题中表现出更优越的性能。ESC 算法的源代码将在 https://aliasgharheidari.com/ESC.html 和其他网站上共享。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Escape: an optimization method based on crowd evacuation behaviors

Meta-heuristic algorithms, particularly those based on swarm intelligence, are highly effective for solving black-box optimization problems. However, maintaining a balance between exploration and exploitation within these algorithms remains a significant challenge. This paper introduces a useful algorithm, called Escape or Escape Algorithm (ESC), inspired by crowd evacuation behavior, to solve real-world cases and benchmark problems. The ESC algorithm simulates the behavior of crowds during the evacuation, where the population is divided into calm, herding, and panic groups during the exploration phase, reflecting different levels of decision-making and emotional states. Calm individuals guide the crowd toward safety, herding individuals imitate others in less secure areas, and panic individuals make volatile decisions in the most dangerous zones. As the algorithm transitions into the exploitation phase, the population converges toward optimal solutions, akin to finding the safest exit. The effectiveness of the ESC algorithm is validated on two adjustable problem size test suites, CEC 2017 and CEC 2022. ESC ranked first in the 10-dimensional, 30-dimensional tests of CEC 2017, and the 10-dimensional and 20-dimensional tests of CEC 2022, and second in the 50-dimensional and 100-dimensional tests of CEC 2017. Additionally, ESC performed exceptionally well, ranking first in the engineering problems of pressure vessel design, tension/compression spring design, and rolling element bearing design, as well as in two 3D UAV path planning problems, demonstrating its efficiency in solving real-world complex problems, particularly complex problems like 3D UAV path planning. Compared with 12 other high-performance, classical, and advanced algorithms, ESC exhibited superior performance in complex optimization problems. The source codes of ESC algorithm will be shared at https://aliasgharheidari.com/ESC.html and other websites.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Artificial Intelligence Review
Artificial Intelligence Review 工程技术-计算机:人工智能
CiteScore
22.00
自引率
3.30%
发文量
194
审稿时长
5.3 months
期刊介绍: Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.
期刊最新文献
Federated learning design and functional models: survey A systematic literature review of recent advances on context-aware recommender systems Escape: an optimization method based on crowd evacuation behaviors A multi-strategy boosted bald eagle search algorithm for global optimization and constrained engineering problems: case study on MLP classification problems Innovative solution suggestions for financing electric vehicle charging infrastructure investments with a novel artificial intelligence-based fuzzy decision-making modelling
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1