Abstract
Electromagnetism-like (EML) algorithm is a new evolutionary algorithm that bases on the electromagnetic attraction and repulsion among particles. It was originally proposed to solve optimization problems with bounded variables. Since its inception, many variants of the EML algorithm have been proposed in the literature. However, it remains unclear how to simulate the electromagnetic heuristics in an EML algorithm effectively to achieve the best performance. This study surveys and compares the EML algorithms in the literature. Furthermore, local search and perturbed point are two techniques commonly used in an EML algorithm to fine tune the solution and to help escaping from local optimums, respectively. Performance study is conducted to understand their impact on an EML algorithm.
Highlights
This paper studied the performance of a new class of evolutionary algorithms called electromagnetism-like (EML) algorithm, recently proposed by Birbil and Fang [1], for optimization problems with bounded variables in the form of: minf x, s.t
It remains unclear how to simulate the electromagnetic heuristics in an EML algorithm effectively to achieve the best performance
Local search and perturbed point are two techniques commonly used in an EML algorithm to fine tune the solution and to help escaping from local optimums, respectively
Summary
This paper studied the performance of a new class of evolutionary algorithms called electromagnetism-like (EML) algorithm, recently proposed by Birbil and Fang [1], for optimization problems with bounded variables in the form of: minf x , s.t. L x U (1).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
