DocumentCode :
2915648
Title :
Magnetic Optimization Algorithms a new synthesis
Author :
Tayarani, M.H. ; Akbarzadeh-T, Mohammad Reza
Author_Institution :
Dept. of Comput. Eng., Azad Univ., Tehran
fYear :
2008
fDate :
1-6 June 2008
Firstpage :
2659
Lastpage :
2664
Abstract :
A novel optimization algorithm is proposed here that is inspired by the principles of magnetic field theory. In the proposed Magnetic Optimization Algorithm (MOA) the possible solutions are magnetic particles scattered in the search space. Each magnetic particle has a measure of mass and magnetic field according to its fitness. The fitter magnetic particles are those with higher magnetic field and higher mass. These particles are located in a lattice-like environment and apply a force of attraction to their neighbors. The proposed cellular structure allows a better exploitation of local neighborhoods before they move towards the global best, hence it increases population diversity. Experimental results on 14 numerical benchmark functions show that MOA in some benchmark functions can work better than GA and PSO.
Keywords :
genetic algorithms; particle swarm optimisation; cellular structure; genetic algorithms; magnetic field theory; magnetic optimization algorithms; magnetic particles; particle swarm optimization; quantum evolutionary algorithms; Acceleration; Clustering algorithms; Evolutionary computation; Genetic algorithms; Magnetic field measurement; Magnetic particles; Particle swarm optimization; Partitioning algorithms; Robustness; Vehicle dynamics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on
Conference_Location :
Hong Kong
Print_ISBN :
978-1-4244-1822-0
Electronic_ISBN :
978-1-4244-1823-7
Type :
conf
DOI :
10.1109/CEC.2008.4631155
Filename :
4631155
Link To Document :
بازگشت