摘要
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 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.
出处
《计算机科学》
CSCD
北大核心
2003年第5期73-75,共3页
Computer Science
基金
国家自然科学基金(69703011)
教育部骨干教师资助计划
关键词
单亲遗传算法
TSP问题
PGA算法
运筹学
解
TSP, Combinatory operator, Evolution cycle, Partheno-genectic algorithm
