BMOA: Binary Magnetic Optimization Algorithm
TL;DR: The binary version of MOA, named BMOA is proposed and results indicate that B MOA is capable of finding global minima more accurate and faster than PSO and GA.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Fig. 3. The 2-D versions of benchmark functions: (a) F1; (b) F2; (c) F3; (d) F4 
Fig. 2. Two transfer functions: (a) sigmoid; (b) tangent hyperbolic 
Fig. 1. Two interaction topologies: (a) cellular; (b) fully-connected 
TABLE II: INITIAL PARAMETERS FOR BMOA, BPSO, AND GA 
Fig. 4. Convergence curves of the algorithms on (a) F1; (b) F2; (c) F3; (d) F4 
TABLE I: BENCHMARK FUNCTIONS
Citations
S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization
Seyedali Mirjalili,Andrew Lewis +1 more
TL;DR: Six new transfer functions divided into two families, s-shaped and v-shaped, are introduced and evaluated and prove that the new introduced v- shaped family of transfer functions significantly improves the performance of the original binary PSO.
1K
Manta ray foraging optimization: An effective bio-inspired optimizer for engineering applications
TL;DR: The comparison results on the benchmark functions suggest that MRFO is far superior to its competitors, and the real-world engineering applications show the merits of this algorithm in tackling challenging problems in terms of computational cost and solution precision.
863
Binary bat algorithm
TL;DR: The proposed binary bat algorithm (BBA) is able to significantly outperform others on majority of the benchmark functions and there is a real application of the proposed method in optical engineering called optical buffer design that evidence the superior performance of BBA in practice.
672
Recording and playback of camera shake: benchmarking blind deconvolution with a real-world database
Rolf Köhler,Michael Hirsch,Betty J. Mohler,Bernhard Schölkopf,Stefan Harmeling +4 more
- 07 Oct 2012
TL;DR: This paper presents a benchmark dataset for motion deblurring that allows quantitative performance evaluation and comparison of recent approaches featuring non-uniform blur models, and evaluates state-of-the-art single image BD algorithms incorporating uniform and non- uniform blur Models.
Atom search optimization and its application to solve a hydrogeologic parameter estimation problem
TL;DR: A novel physics-inspired metaheuristic optimization algorithm, atom search optimization (ASO), inspired by basic molecular dynamics, is developed to address a diverse set of optimization problems.
544
References
Genetic algorithms in search, optimization and machine learning
David E. Goldberg
- 01 Jan 1989
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
58.6K
•Book
Genetic algorithms in search, optimization, and machine learning
David E. Goldberg
- 01 Sep 1988
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
46.9K
Particle swarm optimization
James Kennedy,Russell C. Eberhart +1 more
- 06 Aug 2002
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
44.1K
•Book
Adaptation in natural and artificial systems
John H. Holland
- 01 Jan 1975
TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Related Papers (5)
James Kennedy,Russell C. Eberhart +1 more
- 06 Aug 2002
Zong Woo Geem,Joong Hoon Kim,G. V. Loganathan +2 more
- 01 Feb 2001
John H. Holland
- 01 Jan 1975