“…Extensive computational experiments have been conducted (Korotkikh 2003; by using the problems of a class P={eil76, eil101, st70, rat195, lin105, kroC100, kroB100, kroA100, kroD100, d198, kroA150, pr107, u159, pr144, pr144, pr152, pr226, pr136, pr76, ts225} selected from the benchmark traveling salesman problems (Reinelt 2000).…”