A Memetic Algorithm for the Traveling Salesman Problem

Abstract

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.