单亲遗传算法在TSP问题中的应用  

Application of Partheno-Genertic Algorithm in Traveling Salesman Problem

作　　者：孟文君[1] 徐维祥[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《物流技术》2009年第11期73-75,共3页Logistics Technology

基　　金：北京市教育委员会科技发展计划重点项目(KZ200710028014)

摘　　要：基于单亲遗传算法的思想,编写了求解TSP问题的程序,给出了数值算例,并与遗传算法及蚁群算法在TSP问题的求解效率上进行了比较。结果表明,单亲遗传算法是求解TSP等组合优化问题的非常有效的算法。Based on the Partheno-genetic algorithm, a program is coded in Matlab to solve the TSP （Traveling Salesman problem）. Then numerical examples are conducted to highlight the performance of the partheno-genetic algorithm through comparing with the results obtained by the genetic algorithm and ant colony optimization. Numerical results show that the partheno-genetic algorithm is very effective for solving the combinatorial optimization problems.

关 键 词：单亲遗传算法 TSP 基因重组 组合优化 

分 类 号：F224.0[经济管理—国民经济]