Solving Traveling Salesman Problem by Using an Evolutionary Algorithm Based on the Local Search Strategy

Authors:
Xuan Wang;Gan-Nian Zhang;Yuan-Xiang Li
Affiliations:
Department of Information Technology, HuaZhong Normal University, Wuhan, China 430079;Department of Information Technology, HuaZhong Normal University, Wuhan, China 430079;State Key Laboratory of Software Engineering, Wuhan University, Wuhan, China 430072
Venue:
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II
Year:
2009

Citing 7
Cited 0

An improved solution to the traveling salesman problem with thousands of nodes

Communications of the ACM - Special section on management of information systems
Applying evolutionary programming to selected traveling salesman problems

Cybernetics and Systems
Genetic Algorithms for the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Application of the `Evolutionsstrategie' to Discrete Optimization Problems

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Local Optimization and the Traveling Salesman Problem

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Applying adaptive algorithms to epistatic domains

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new evolutionary algorithm based on the local search strategy and uses it to solve the Traveling Salesman Problem. The algorithm incorporates speediness of local search methods in neighborhood search with robustness of evolutionary methods in global search in order to obtain global optimum. The experimental results show that the algorithm is of potential to obtain global optimum or more accurate solutions than other evolutionary methods for the TSP.