most citedAn improved genetic algorithm with a local optimization strategy and an extra mutation level for solving traveling salesman problem

6 citations · 6 across the 1 of their papers we have counts for

collaborators

1 paper

cs.NE2014★ 6 cited

An improved genetic algorithm with a local optimization strategy and an extra mutation level for solving traveling salesman problem

Keivan Borna, Vahid Haji Hashemi

The Traveling salesman problem (TSP) is proved to be NP-complete in most cases. The genetic algorithm (GA) is one of the most useful algorithms for solving this problem. In this pa…