A New Solution for Travelling Salesman Problem By Genetic Algorithm
Main Article Content
Abstract
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
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.