Genetic Algorithm for the Travelling Salesman Problem Using New Crossover and Mutation Operators

【摘要】：正In this paper we are proposing a new Genetic Algorithm approach to solve the travelling Salesman Problem(TSP).Genetic Algorithmic is one of the search approaches to solve optimization problems.The proposed Genetic Algorithm is based on the goal of finding the less weight while visiting all cities based on the weights it has. This approach is having new crossover and mutation techniques,based on the weights of the edges of TSP,the selected nodes for crossover from different parents will be used in the place of child which gives less cost to the path forming,sometimes may have shifting of the nodes. Mutation will have the swapping of selected node to the node which gives less cost to the path(based on weights), but within the chromosome,which gives the better optimization for problem solving.