Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space
WJ Zhang, XF Xie, DC Bi - Proceedings of the 2004 Congress …, 2004 - ieeexplore.ieee.org
WJ Zhang, XF Xie, DC Bi
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE …, 2004•ieeexplore.ieee.orgThe periodic mode is analyzed together with two conventional boundary handling modes for
particle swarm. By providing an infinite space that comprises periodic copies of original
search space, it avoids possible disorganizing of particle swarm that is induced by the
undesired mutations at the boundary. The results on benchmark functions show that particle
swarm with periodic mode is capable of improving the search performance significantly, by
compared with that of conventional modes and other algorithms.
particle swarm. By providing an infinite space that comprises periodic copies of original
search space, it avoids possible disorganizing of particle swarm that is induced by the
undesired mutations at the boundary. The results on benchmark functions show that particle
swarm with periodic mode is capable of improving the search performance significantly, by
compared with that of conventional modes and other algorithms.
The periodic mode is analyzed together with two conventional boundary handling modes for particle swarm. By providing an infinite space that comprises periodic copies of original search space, it avoids possible disorganizing of particle swarm that is induced by the undesired mutations at the boundary. The results on benchmark functions show that particle swarm with periodic mode is capable of improving the search performance significantly, by compared with that of conventional modes and other algorithms.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果