title: Composite Particle Swarm Optimizer With Historical Memory for Function Optimization.
abstract: Particle swarm optimization (PSO) algorithm is a population-based stochastic optimization technique. It is characterized by the collaborative search in which each particle is attracted toward the global best position (gbest) in the swarm and its own best position (pbest). However, all of particles' historical promising pbests in PSO are lost except their current pbests. In order to solve this problem, this paper proposes a novel composite PSO algorithm, called historical memory-based PSO (HMPSO), which uses an estimation of distribution algorithm to estimate and preserve the distribution information of particles' historical promising pbests. Each particle has three candidate positions, which are generated from the historical memory, particles' current pbests, and the swarm's gbest. Then the best candidate position is adopted. Experiments on 28 CEC2013 benchmark functions demonstrate the superiority of HMPSO over other algorithms.
authors.forename: Jie
authors.initials: J
authors.lastname: Li
authors.forename: JunQi
authors.initials: J
authors.lastname: Zhang
authors.forename: ChangJun
authors.initials: C
authors.lastname: Jiang
authors.forename: MengChu
authors.initials: M
authors.lastname: Zhou