期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2013
卷号：4
期号：2
页码：314-317
语种：English
出版社：Ayushmaan Technologies
摘要：The traveling salesman Problem is considered to be a N.P Hard Problem. Genetic Algorithm (GA) is an approximate algorithm that doesn’t always aim to find the shortest tour but to find a reasonably short tour quickly. Crossover operators play important role in G.A. In this paper various crossover operators are used. The results shows that PMX is best among all.
