ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Different Genetic Operator Based Analysis and Exploration of TSP?

Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 4)

Publication Date:

Authors : ;

Page : 677-687

Keywords : Travelling Salesman Problem; Genetics; Crossover; Mutation; Selection; Reproduction;

Source : Downloadexternal Find it from : Google Scholarexternal


TSP has been considered the most complex algorithmic problem because of its time complexity. TSP comes under the NP Complete problem that becomes more critical as the number of cities increases. In this present work, an effective solution to TSP is provided using genetic approach. The work has presented genetic based model to generate the TSP path in effective time. The improvement is here performed on fitness function and crossover stages where the cost based analysis is performed to generate the effective path. In this paper, a detailed description to genetic process model is given with exploration of different stages of genetics. The paper also includes the presented algorithm along with associated assumptions. The work will be able to provide effective solution in optimized time.

Last modified: 2014-04-23 18:11:54