期刊名称:International Journal of Soft Computing & Engineering
电子版ISSN:2231-2307
出版年度:2013
卷号:3
期号:2
页码:252-258
出版社:International Journal of Soft Computing & Engineering
摘要:Simple Symmetric Traveling Salesman Problem (TSP) has a combinational nature. When there are 25 or more cities to visit, brute force search is not feasible. Instead, heuristic & probabilistic search methods are more reasonable for obtaining optimal solutions. In this paper, Genetic algorithm and crossover are researched and a novel crossover operator has been introduced by combining two existing crossover methods named PMX and OX crossover. The proposed operator is tested on 4 different inputs from TSPLIB provided by Heidelberg University and the result are compared with Partial Matched Crossover(PMX), Order Crossover(OX) and cyclic crossover(CX) and is found that proposed crossover has outperformed the rest in all the problems..
关键词:Crossover; Genetic Algorithm; Traveling;Salesman Problem (TSP).