作者: Sabine Helwig , Frank Neumann , Rolf Wanka
DOI: 10.1007/978-3-642-17390-5_7
关键词: Optimization problem 、 Range (mathematics) 、 Benchmark (computing) 、 Multi-swarm optimization 、 Bounded function 、 Particle swarm optimization 、 Mathematical optimization 、 Swarm intelligence 、 Continuous optimization 、 Computer science
摘要: Swarm Intelligence methods have been shown to produce good results in various problem domains. A well-known method belonging this kind of algorithms is particle swarm optimization (PSO). In chapter, we examine how adaptation mechanisms can be used PSO better deal with continuous problems. case bound-constrained problems, one has cope the situation that particles may leave feasible search space. To such situations, different bound handling were proposed literature, and it was observed success highly depends on chosen method. We consider velocity bounded spaces. Using approach show becomes less important for using leads a wide range benchmark functions.