一种求解函数优化问题的单亲遗传算法

A Partheno Genetic Algorithm for Traveling Salesman Problem

In this paper, a kind of Partheno Genetic Algorithm (PGA) based on Path Representation scheme is proposed for solving Traveling Salesman Problem (TSP). This algorithm employs only mutation and selection operators to produce the offspring,instead of traditional crossover operator. A specfiic mutation operator is designed combining the insertion operator with reversion operator,which ensures its strong searching capability. This algorithm simulates the recurrence of nature evolution process, while providing fewer control parameters. Experiments based on Ciunese 144 cities(CHN144)and 7 instances selected from TSPLIB are used to test the performance of this algorithm. They prove that it can reach the satisfying optimization at a faster speed. Especially,for the CHN144,the best path it finds is better than any other available one.

In this paper, a kind of Partheno Genetic Algorithm (PGA) based on Path Representation scheme is proposed for solving Traveling Salesman Problem (TSP ). This algorithm employs only mutation and selection operators to produce the offspring, instead of traditional crossover operator. A specific mutation operator is designed combining the insertion operator with inversion operator .which ensures its strong searching capability. This algorithm simulates the recurrence of nature evolution process, while providing fewer control parameters. Experiments based on Chinese 144 cities(CHN144)and 7 instances selected from TSPLIB are used to test the performance of this algorithm. They prove that it can reach the satisfying optimization at a faster speed. Especially,for the CHN144,the best path it finds is better than any other available one.