I was under the impression that memetic algorithms for TSP (Travelling Salesman Problem) performed a lot better than expected: https://en.wikipedia.org/wiki/Mem

I was under the impression that memetic algorithms for TSP (Travelling Salesman Problem) performed a lot better than expected: https://en.wikipedia.org/wiki/Memetic_algorithm https://en.wikipedia.org/wiki/Memetic_algorithm I was told this by a professor in graph theory who co-authored a book on TSP. But he had no hand in the implementation or the testing AFAICT.