A new imperialist competitive algorithm with spiral rising mechanism for solving path optimization problems.

PeerJ Computer Science Pub Date : 2022-09-07 eCollection Date: 2022-01-01 DOI:10.7717/peerj-cs.1075
Xia Li, Junhan Chen, Lingfang Sun, Jing Li
{"title":"A new imperialist competitive algorithm with spiral rising mechanism for solving path optimization problems.","authors":"Xia Li,&nbsp;Junhan Chen,&nbsp;Lingfang Sun,&nbsp;Jing Li","doi":"10.7717/peerj-cs.1075","DOIUrl":null,"url":null,"abstract":"<p><p>Intelligent optimization algorithms have now become important means for solving global optimization problems. The imperialist competitive algorithm (ICA) is a nature-inspired meta-heuristic algorithm that imitates social behavior. ICA has been widely used in optimization problems, however, ICA tends to fall into a local optimal solution because of its fast convergence speed, which may lead to premature convergence when solving optimization problems. To solve these problems, a new improved ICA algorithm is proposed. Based on the original ICA algorithm, the theory of spiral rising is introduced to enlarge the search space and enhance the global search ability of the algorithm based on ensuring the necessary speed of convergence. In this paper, the improved optimization algorithm is applied to 19 classical benchmark functions, and the improved ICA is applied to the robot path optimization problems to solve the optimal path. The improved ICA algorithm improves the optimization ability and algorithm stability.</p>","PeriodicalId":503620,"journal":{"name":"PeerJ Computer Science","volume":" ","pages":"e1075"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9575848/pdf/","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PeerJ Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.7717/peerj-cs.1075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2022/1/1 0:00:00","PubModel":"eCollection","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Intelligent optimization algorithms have now become important means for solving global optimization problems. The imperialist competitive algorithm (ICA) is a nature-inspired meta-heuristic algorithm that imitates social behavior. ICA has been widely used in optimization problems, however, ICA tends to fall into a local optimal solution because of its fast convergence speed, which may lead to premature convergence when solving optimization problems. To solve these problems, a new improved ICA algorithm is proposed. Based on the original ICA algorithm, the theory of spiral rising is introduced to enlarge the search space and enhance the global search ability of the algorithm based on ensuring the necessary speed of convergence. In this paper, the improved optimization algorithm is applied to 19 classical benchmark functions, and the improved ICA is applied to the robot path optimization problems to solve the optimal path. The improved ICA algorithm improves the optimization ability and algorithm stability.

Abstract Image

Abstract Image

Abstract Image

求解路径优化问题的一种新的螺旋上升机制的帝国主义竞争算法。
智能优化算法已成为解决全局优化问题的重要手段。帝国主义竞争算法(ICA)是一种模仿社会行为的自然启发的元启发式算法。ICA在优化问题中得到了广泛的应用,但由于ICA的收敛速度快,容易陷入局部最优解,在求解优化问题时容易出现过早收敛。为了解决这些问题,提出了一种改进的ICA算法。在原有ICA算法的基础上,引入螺旋上升理论,在保证必要收敛速度的基础上,扩大了算法的搜索空间,增强了算法的全局搜索能力。本文将改进的优化算法应用于19个经典基准函数,并将改进的ICA应用于机器人路径优化问题,求解最优路径。改进的ICA算法提高了算法的优化能力和稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书