摘要
基于单亲遗传算法的思想,编写了求解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.
出处
《物流技术》
2009年第11期73-75,共3页
Logistics Technology
基金
北京市教育委员会科技发展计划重点项目(KZ200710028014)
关键词
单亲遗传算法
TSP
基因重组
组合优化
partheno-genetie algorithm
TSP
gene reconstruction
combinatorial optimization
