Traveling Salesman Problem Syed Tauhid Zuhori

ISBN: 9783846583050

Published: January 31st 2012


56 pages


Traveling Salesman Problem  by  Syed Tauhid Zuhori

Traveling Salesman Problem by Syed Tauhid Zuhori
January 31st 2012 | Paperback | PDF, EPUB, FB2, DjVu, AUDIO, mp3, RTF | 56 pages | ISBN: 9783846583050 | 3.13 Mb

The traveling salesman problem (TSP) is one of the most widely studied NP hard combinatorial optimization problems and has already solved in the semi-optimal manners using numbers of different methods. Among them, Genetic Algorithms (GA) is pre-dominating. In this paper I solve the problem with a new operator, Inver-over, for an evolutionary algorithm for the TSP. This operator outperforms all other genetic operators, whether unary or binary, which was first introduced by Guo Tao and Zbigniew Michalewicz.

I also propose a new algorithm for solving TSP and also introduced it modified version. To get a comparative idea of the performance of these algorithms I solve same problems with the two algorithms. The performance analysis shows that my proposed algorithm produces relatively better solutions in the case of the tour length every time. But when we increase the cities it takes more time to solve than the Inver-Over operator for TSP.

Enter the sum

Related Archive Books

Related Books


Comments for "Traveling Salesman Problem":

©2011-2015 | DMCA | Contact us