In this paper, a kind of Partheno Genetic Algorithm(PGA)based on Path Representation scheme is pro-posed for solving Traveling Salesman Problem(TSP). This algorithm employs only mutation and selection operatorsto prod...In this paper, a kind of Partheno Genetic Algorithm(PGA)based on Path Representation scheme is pro-posed for solving Traveling Salesman Problem(TSP). This algorithm employs only mutation and selection operatorsto produce the offspring, instead of traditional crossover operator. A specific mutation operator is designed combiningthe insertion operator with inversion operator, which ensures its strong searching capability. This algorithm simu-lates the recurrence of nature evolution process, while providing fewer control parameters. Experiments based onChinese 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 pathit finds is better than any other available one.展开更多
文摘In this paper, a kind of Partheno Genetic Algorithm(PGA)based on Path Representation scheme is pro-posed for solving Traveling Salesman Problem(TSP). This algorithm employs only mutation and selection operatorsto produce the offspring, instead of traditional crossover operator. A specific mutation operator is designed combiningthe insertion operator with inversion operator, which ensures its strong searching capability. This algorithm simu-lates the recurrence of nature evolution process, while providing fewer control parameters. Experiments based onChinese 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 pathit finds is better than any other available one.
