Solving Traveling Salesman Problem with Pseudo-Parallel Genetic Algorithm

摘要：

Traveling salesman problem (TSP) is a typical NP complete combinatorial optimum problem. The paper introduces an improved pseudo-parallel genetic algorithm (IPPGA) with an asexual reproduction for avoiding crossover operators breach to nice gene patterns. Initial population is produced by greedy algorithm in order to enhance convergence velocity. Information exchange between subgroups adopts island model in IPPGA. These measures have magnitude significance on reducing complexities, enhancing convergence velocity and increasing global searching ability of the algorithm. Simulation study of IPPGA has proved its capability of strong global search and superiority to SGA and high immunity against premature convergence.

作者: Jiesheng Wang Jun Liu

作者单位: School of Electronic and Information Engineering Liaoning University of Science & Technology Anshan, China 114044

会议类型: 国际会议

会议名称: Fourth International Conference on Impulsive and Hybrid Dynamical Systems(ICIHDS 2007)(第四届国际脉冲和混合动力系统学术会议)

会议地点: 南宁

会议语种:英文

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