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

10 Sep 2014Keivan BornaVahid 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... (read more)

PDF Abstract


No code implementations yet. Submit your code now

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.