期刊
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
卷 17, 期 2, 页码 259-271出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TEVC.2012.2189404
关键词
Constrained optimization; particle swarm optimization (PSO)
Many practical optimization problems are constrained and have a bounded search space. In this paper, we propose and compare a wide variety of bound handling techniques for particle swarm optimization. By examining their performance on flat landscapes, we show that many bound handling techniques introduce significant search bias. Furthermore, we compare the performance of many bound handling techniques on a variety of test problems, demonstrating that the bound handling technique can have a major impact on the algorithm performance, and that the method recently proposed as the standard does not, in general, perform well.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据