In our paper we compare discrete memetic evolutionary metaheuristics (and other algorithms) which are applicable (also) for the widely studied and industrially applied (symmetric, Euclidean) NP-hard combinatorial optimization problem called Traveling Salesman Problem (TSP) such as DBMEA (Discrete Bacterial Memetic Evolutionary Algorithm), DMTLBO (Discrete Memetic Teaching–Learning Based Optimization) not to mention DMSSA (Discrete Memetic Squirrel Search Algorithm) algorithms. The comparisons occurred under the same fixed conditions.