Un algoritmo memético para resolver un problema de agente viajero (A Memetic Algorithm for the Traveling Salesman Problem)

Martin Dario Arango Serna (mdarango@unal.edu.co)1, Conrado Augusto Serna Uran (casernau@unal.edu.co)2

1Universidad Nacional de Colombia
2Universidad San Buenaventura

This paper appears in: Revista IEEE América Latina

Publication Date: Aug. 2015
Volume: 13,   Issue: 8 
ISSN: 1548-0992

This paper is designed a hybrid algorithm for solving the traveling salesman problem, which is listed among the NP-complete and which has received much attention in recent decades. As a solution strategy, we propose a memetic algorithm; which is based on the combination of an evolutionary algorithm and local search (2-opt), while the first analyzes several search spaces, the second explodes (improvement) each of the solutions found by the evolutionary algorithm. An individual analysis of the main heuristics used is made in the article

Index Terms:
traveling salesman problem, evolutionary algorithm, memetic algorithm,   

Documents that cite this document
This function is not implemented yet.

[PDF Full-Text (432)]