A Discrete Binary Version of the Electromagnetism-Like Heuristic for Solving Traveling Salesman Problem

Authors:
Nikbakhsh Javadian;Mohsen Gol Alikhani;Reza Tavakkoli-Moghaddam
Affiliations:
Department of Industrial Engineering, Mazandaran University of Science, and Technology, Babol, Iran;Department of Industrial Engineering, Mazandaran University of Science, and Technology, Babol, Iran;Department of Industrial Engineering, Faculty of Engineering, University of Tehran, Tehran, Iran
Venue:
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Year:
2008

Citing 6
Cited 3

An Electromagnetism-like Mechanism for Global Optimization

Journal of Global Optimization
On the Convergence of a Population-Based Global Optimization Algorithm

Journal of Global Optimization
A discrete version of particle swarm optimization for flowshop scheduling problems

Computers and Operations Research
An electromagnetic meta-heuristic for the nurse scheduling problem

Journal of Heuristics
A hybrid electromagnetism-like algorithm for single machine scheduling problem

Expert Systems with Applications: An International Journal
A hybrid discrete particle swarm optimization for the traveling salesman problem

SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning

Applying electromagnetism-like mechanism for feature selection

Information Sciences: an International Journal
A discrete electromagnetism-like mechanism for single machine total weighted tardiness problem with sequence-dependent setup times

Applied Soft Computing
A hybrid Electromagnetism-like Mechanism/tabu search procedure for the single machine scheduling problem with a maximum lateness objective

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The electromagnetism-like method (EM) is a meta-heuristic algorithm utilizing an attraction-repulsion mechanism to move sample points (i.e., our solutions) towards the optimality. In general, the EM method has been initially used for solving continuous optimization problems and could not be applied on combinatorial optimization ones. This paper proposes a discrete binary version of the electromagnetism-like method (EM) for solving the combinatorial optimization problems. To show the efficiency of our proposed EM, we use it for solving the traveling salesman problem and compare our computational results with those reported in the literature. Finally we conclude that our method is capable of solving such well-known problems more efficiently than the previous works.