Abstract
Abstract
TSP is a well-known optimization problem. It comes in the category of NP-Hard problems. The solution of TSP problem is not possible using traditional algorithms. It is having many application areas in science and engineering. Genetic algorithm is a well-known AI technique which performs well to solve optimization problems. The performance of genetic algorithm depends upon its operators. In this paper a novel genetic cross over is proposed to solve TSP problem. The performance of proposed algorithm is better as compared to other techniques to solve TSP.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献