A New Solution for Travelling Salesman Problem By Genetic Algorithm

Shirin Hatami, Morteza Babazadeh


In this paper we have proposed a new solution for TSP. in the beginning of the algorithm we produce pool of solutions randomly and
then we try to obtain better solutions by mutation, cross over and selection best chromosomes. We have designed a special kind of cross over
and mutation operator in this algorithm. Each chromosome has a fitness that represents length of a tour and an importance number that
represents number of links in proposed tour of chromosome.


Keywords: TSP; Genetic Algorithm; NP-complete

Full Text:


DOI: https://doi.org/10.26483/ijarcs.v2i6.881


  • There are currently no refbacks.

Copyright (c) 2016 International Journal of Advanced Research in Computer Science