A Revised EM-Like Algorithm + K-OPT Method for Solving the Traveling Salesman Problem

Authors:
Peitsang Wu;Kung-Jiuan Yang;Hsin-Chieh Fang
Affiliations:
I-Shou University, Taiwan;Fortune Institute of Technology, Taiwan;I-Shou University, Taiwan
Venue:
ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1
Year:
2006

Citing 0
Cited 2

DEM: a discrete electromagnetism-like mechanism for solving discrete problems

CIRA'09 Proceedings of the 8th IEEE international conference on Computational intelligence in robotics and automation
A dynamic max-min ant system for solving the travelling salesman problem

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this study, the main objective is to solve the traveling salesman problems (TSP). TSP belongs to a part of the combinatorial optimization problems and NP-complete problems. Though this problem is easy to describe and understand, when the problems of the dimensions are bigger, it becomes difficult and hard to solve. If we consider all feasible solutions, it may cost a lot of time and not be effective. In this study, we utilize the new meta-heuristic algorithm, called the Electromagnetism-like algorithm (EM) which was proposed by Birbil and Fang[1], to solve the TSP problem. Although EM has been used to solve the TSP[6], the results sometimes can not jump out the local optimum. Therefore, a revised EM-like algorithm + k-opt method is introduced and expects to obtain a better solution than the original EM.