A comparison of memetic recombination operators for the traveling salesman problem
Peter Merz · 2002
Several memetic algorithms (MAs) { evolutionary algorithms incorporating local search { have been proposed for the traveling salesman problem (TSP). Much eort has been spent to develop recombination operators for MAs which aim to exploit problem characteristics to achieve a highly eective search.