.png){kind=icon}
.png){kind=icon}
Return
A new hybrid approach for dynamic continuous optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2011.11.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new hybrid approach for dynamic optimization problems with continuous search spaces is presented. The proposed approach hybridizes efficient features of the particle swarm optimization in tracking dynamic changes with a new evolutionary procedure. In the proposed dynamic hybrid PSO (DHPSO) algorithm, the swarm size is varied in a self-regulatory manner. Inspired from the microbial life, the particles can reproduce infants and the old ones die. The infants are especially reproduced by high potential particles and located near the local optimum points, using the quadratic interpolation method. The algorithm is adapted to perform in continuous search spaces, utilizing continuous movement of the particles and using Euclidian norm to define the neighborhood in the reproduction procedure. The performance of the new proposed approach is tested against various benchmark problems and compared with those of some other heuristic optimization algorithms. In this regard, different types of dynamic environments including periodic, linear and random changes are taken with different performance metrics such as real-time error, offline performance and offline error. The results indicate a desirable better efficiency of the new algorithm over the existing ones. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Dynamic optimization
Particle swarm optimization
Quadratic interpolation
Reproduction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W