Multiple k −opt evaluation multiple k −opt moves with GPU high performance local search to large-scale traveling salesman problems

The 2-opt, 3-opt or k –opt heuristics are classical local search algorithms for traveling salesman problems (TSP) in combinatorial optimization area, while sequential k –opt complete neighborhood examination takes polynomial time complexity which is timeconsuming to approach large scale TSP instance...

Celý popis