BMOA: Binary Magnetic Optimization Algorithm

Recently, the behavior of natural phenomena has become one the most popular sources for researchers in to design optimization algorithms. One of the recent heuristic optimization algorithms is Magnetic Optimization Algorithm (MOA) which has been inspired by magnetic field theory. It has been shown that this algorithm is useful for solving complex optimization problems. The original version of MOA has been introduced in order to solve the problems with continuous search space, while there are many problems owning discrete search spaces. In this paper, the binary version of MOA named BMOA is proposed. In order to investigate the performance of BMOA, four benchmark functions are employed, and a comparative study with Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) is provided. The results indicate that BMOA is capable of finding global minima more accurate and faster than PSO and GA.

[1]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[2]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[3]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[4]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[7]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[8]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  M.H. Tayarani-N,et al.  Magnetic Optimization Algorithms a new synthesis , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[10]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[11]  Hossein Nezamabadi-pour,et al.  BGSA: binary gravitational search algorithm , 2010, Natural Computing.