IEEE Access · 2018 · 16 citations · 57 references
ArchitectureComputational EngineeringDesign OptimizationEvolutionary TheoryOptimizationEvolutionary ComputationEvolutionary OptimizationMetaheuristic OptimizationMutation OperatorsPopulation-based SearchEvolutionary AlgorithmsEvolutionary SearchLocal OptimaLocal SearchLocal Search AlgorithmsMutationParticle Swarm OptimizationPopulation-based Optimization
Particle swarm optimization (PSO) is an evolutionary algorithm that is well known for its simplicity and effectiveness. It usually has strong global search capability but has the drawback of being easily trapped by local optima. A scaling mutation strategy and an elitist learning strategy are presented in this paper. Based on these strategies, an improved PSO variant (LSERPSO) is developed through a local search and ring topology strategy. The new scaling mutation strategy involved an exploration and exploitation balance focusing on mutation operation. A collection of elite individuals is maintained such that an array of current particles can learn from them. A ring topology-based neighborhood structure is adopted to maintain the population diversity and to reduce the possibility of particles being trapped in local optima. Finally, a quasi-Newton-based local search is incorporated to enhance the fine-grained capability. The effects of these proposed strategies and their cooperation are verified step by step. The performance of LSERPSO is comprehensively studied using IEEE CEC2015 benchmark functions.
57
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy · 2002 · 14.9K citations
A modified particle swarm optimizer
Yibing Shi, R.C. Eberhart · 2002 · 10.2K citations
Empirical study of particle swarm optimization
Yibing Shi, R.C. Eberhart · 2003 · 3.9K citations
Evolutionary programming made faster
Xin Yao, Yong Liu, Guangming Lin · IEEE Transactions on Evolutionary Computation · 1999 · 3.9K citations