An Effective Parallel Hybrid GA for Traveling Salesman Problem

摘要：

This correspondence presents a hybrid genetic algorithm(GA)to find high-quanty solutions to the Traveling Salesman Problem (TSP).The proposed method is combined with Rreedy algorithm in the crossover and Lin-Kernighan heuristics in the mutation to compensate for the traditional GA lack of local search ability.Compared it with other GAs.it works more effectively and emciently.Based on these.it utilizes recursive divide and conquer approach to paraUelize the hybrid GA.The Experimental result with benchmarks shows that this algorithm not only has a high tour quality but also costs less running time.

关键词： TSP GA Parallel Divide and Conquer

作者: Yanbin Liu Jun Huang

会议类型: 国际会议

会议名称: The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)

会议地点: 成都

会议语种:英文

页码: 695-698

在线出版日期: 2007-12-19（万方平台首次上网日期，不代表论文的发表时间）