DocumentCode :
578445
Title :
Particle swarm optimization algorithms for mini-benchmark problems
Author :
Chou, Pen-chen ; Hong, Sau-bor
Author_Institution :
Fac. of Electr. Eng., DaYeh Univ., ChungHwa, Taiwan
Volume :
5
fYear :
2012
fDate :
15-17 July 2012
Firstpage :
1656
Lastpage :
1661
Abstract :
Simulated annealing, genetic algorithms, evolutionary programming, swarm intelligence, and ant colony optimization are active research areas in Smart and intelligent innovative algorithms. In particular, Particle Swarm Intelligence (PSI) attracts more attentions because of its simplicity and time efficiency. Recent advance on PSI research includes a classification of PSI or Particle Swarm Optimization (PSO) to Standard PSO. A SPSO is supposed to work on most optimization problems (difficult or easy). However, with different problem constraints, no universal SPSO can work for all problems efficiently. Based on the idea of mini-benchmarking proposed by Maurice Clere, specified PSO (SPPSO) algorithms are proposed in this paper to address the four different problems raised in Maurice Clere´s work.
Keywords :
ant colony optimisation; genetic algorithms; particle swarm optimisation; simulated annealing; swarm intelligence; PSI research; SPPSO; active research areas; colony optimization; evolutionary programming; genetic algorithms; intelligent innovative algorithms; minibenchmark problems; particle swarm intelligence; particle swarm optimization algorithms; simulated annealing; smart innovative algorithms; specified PSO algorithms; standard PSO; Abstracts; Iron; Optimization; Benchmark for optimization; Genetic algorithms; Global search; Particle swarm intelligence;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics (ICMLC), 2012 International Conference on
Conference_Location :
Xian
ISSN :
2160-133X
Print_ISBN :
978-1-4673-1484-8
Type :
conf
DOI :
10.1109/ICMLC.2012.6359623
Filename :
6359623
Link To Document :
بازگشت