arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2206.13802math.OC
收藏

基于种群算法的约束处理技术综述:从单目标到多目标最优化

A Review on Constraint Handling Techniques for Population-based Algorithms: from single-objective to multi-objective optimization

Iman Rahimi, Amir H. Gandomi, Fang Chen, Efren Mezura-Montes

摘要:

这项研究提供了一个新的分析学术文献的约束处理技术的单目标和多目标人口为基础的算法,根据最相关的期刊,关键字,作者和文章。本文回顾了多目标群体优化中最先进的约束处理技术的主要思想,然后研究了该领域的文献计量学分析。所提取的论文包括2000年至2020年期间发表的研究文章,评论,书籍/书籍章节和会议论文。结果表明,与单目标优化相比,多目标最优化的约束处理技术受到的关注较少。这种优化最有前途的算法被确定为遗传算法,差分进化算法和粒子群智能。

英文摘要:

This presented study provides a novel analysis of scholarly literature on constraint handling techniques for single-objective and multi-objective population-based algorithms according to the most relevant journals, keywords, authors, and articles. The paper reviews the main ideas of the most state-of-the-art constraint handling techniques in multi-objective population-based optimization, and then the study addresses the bibliometric analysis in the field. The extracted papers include research articles, reviews, book/book chapters, and conference papers published between 2000 and 2020 for the analysis. The results indicate that the constraint handling techniques for multi-objective optimization have received much less attention compared with single-objective optimization. The most promising algorithms for such optimization were determined to be genetic algorithms, differential evolutionary algorithms, and particle swarm intelligence.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑