Electromagnetism metaheuristic algorithm for solving the strong minimum energy topology problem
An electromagnetism metaheuristic (EM) algorithm for solving the strong minimum energy topology problem (SMETP) is presented. An appropriate objective function mapping real-valued EM points to binary SMETP solution is implemented. The objective function is adapted to the problem such that it effectively prevents infeasible solutions. The proposed EM algorithm uses efficient local search to speed up overall running time. The scaling of real vectors to obtained integer solutions directs the search towards promising search regions. The EM approach is tested on two sets of randomly generated symmetric and asymmetric instances. The experimental results show that EM matches with all known optimal solutions of tested instances. The solutions are obtained in a reasonable running time even for the problem instances of higher dimensions.
- Introduction to electromagnetism algorithm for the examination timetabling problem and comparison of it with other metaheuristics
- An electromagnetism metaheuristic for the unicost set covering problem
- A novel hybrid approach combining electromagnetism-like method with Solis and Wets local search for continuous optimization problems
- An electromagnetism-like method for the maximum set splitting problem
- An improved electromagnetism-like algorithm for numerical optimization
This page was built for publication: Electromagnetism metaheuristic algorithm for solving the strong minimum energy topology problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929881)