SOLUTION OF TRAVELING SALESMAN PROBLEM ON SCX BASED SELECTION WITH PERFORMANCE ANALYSIS USING GENETIC ALGORITHM

In this paper the implementation and performance of a new unconventional selection operator for Genetic Algorithm have been emphasized. The operator has been tuned specifically to solve the Travelling Salesman Problem. The proposed Selection Operator has been utilized based on Sequential Constructive Crossover. Here the parent’s structure has been chosen as selection criteria of a chromosome to survive for the next generations. Also it is observed that how much the low cost gene sequences of its parent’s structure to optimize the fitness of individuals has been maintained .It has been shown experimentally that the better convergence to optimal andnear optimal solution compared to the traditional TSP with Conventional genetic operators has been achieved.