Title :
Particle swarm optimization with pbest crossover
Author_Institution :
Sch. of Inf. Technol., York Univ., Toronto, ON, Canada
Abstract :
Particle swarm optimization can be viewed as a system with two populations: a population of current positions and a population of personal best attractors. In genetic algorithms, crossover is applied after selection - the goal is to create a new offspring solution using components from the best available solutions. In a particle swarm, the best available solutions are in the population of personal best attractors. Compared to standard particle swarm optimization, a modified version which periodically creates particle positions by crossing the personal best positions can achieve large improvements. These improvements are most consistent on multi-modal search spaces where the new crossover solutions may help the search process escape from local optima.
Keywords :
genetic algorithms; particle swarm optimisation; search problems; genetic algorithms; multimodal search spaces; offspring solution; particle swarm optimization; pbest crossover; personal best attractors; personal best positions; search process; Benchmark testing; Convergence; Genetic algorithms; Optimization; Particle swarm optimization; Search problems; Standards; crossover; exploitation; exploration; multi-modal search spaces; particle swarm optimization;
Conference_Titel :
Evolutionary Computation (CEC), 2012 IEEE Congress on
Conference_Location :
Brisbane, QLD
Print_ISBN :
978-1-4673-1510-4
Electronic_ISBN :
978-1-4673-1508-1
DOI :
10.1109/CEC.2012.6256497