返回
Spider monkey optimization algorithm for constrained optimization problems
DOI:10.1007/s00500-016-2419-0.png)
摘要
En 中文
In this paper, a modified version of spider monkey optimization (SMO) algorithm for solving constrained optimization problems has been proposed. To the best of author's knowledge, this is the first attempt to develop a version of SMO which can solve constrained continuous optimization problems by using the Deb's technique for handling constraints. The proposed algorithm is named constrained spider monkey optimization (CSMO) algorithm. The performance of CSMO is investigated on the well-defined constrained optimization problems of CEC2006 and CEC2010 benchmark sets. The results of the proposed algorithm are compared with constrained versions of particle swarm optimization, artificial bee colony and differential evolution. Outcome of the experiment and the discussion of results demonstrate that CSMO handles the global optimization task very well for constrained optimization problems and shows better performance in comparison with compared algorithms. Such an outcome will be an encouragement for the research community to further explore the potential of SMO in solving benchmarks as well as real-world problems, which are often constrained in nature.
Keyword:
Spider monkey optimization
Constrained optimization
CEC2006
CEC2010
Deb's technique
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
FREE EXPANSION OF PLASMA WITH THREE AND MULTIPLE ELECTRON TEMPERATURES AND PRODUCTION OF FAST IONS等离子体在三重和多电子温度下的自由膨胀及快离子的产生
Nematic elastomers with aligned carbon nanotubes: New electromechanical actuators具有对齐碳纳米管的向列弹性体: 新型机电致动器

