Abstract-A hierarchical version of the particle swarm optimization (PSO) metaheuristic is introduced in this paper. In the new method called H-PSO, the particles are arranged in a dynamic hierarchy that is used to define a neighborhood structure. Depending on the quality of their so-far best-found solution, the particles move up or down the hierarchy. This gives good particles that move up in the hierarchy a larger influence on the swarm. We introduce a variant of H-PSO, in which the shape of the hierarchy is dynamically adapted during the execution of the algorithm. Another variant is to assign different behavior to the individual particles with respect to their level in the hierarchy. H-PSO and its variants are tested on a commonly used set of optimization functions and are compared to PSO using different standard neighborhood schemes. Index Terms-Author, please supply your own keywords or send a blank e-mail to keywords@ieee.org to receive a list of suggested keywords.
Hierarchical particle swarm optimization introduced in REF has been successfully applied in solving continuous optimization functions.
A hierarchical particle swarm optimizer and its adaptive variant
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
Computer Science Medicine