摘要
TSP问题是典型的NP完全问题,遗传算法是求解NP完全问题的一种常用方法。文中将并行遗传算法的迁移策略以伪并行的方式应用于TSP问题的求解,并在迁移过程中进行优化。该算法减少了个体的评价计算量,提高了解的质量。
Traveling Salesman Problem (TSP) is a typical NP-complete problem, which can be solved by the genetic algorithm popularly. The parallel genetic algorithm which pays attention to the advantages of migration strategy is presented, and it can be used to solve the TSP problem by a pseudo collateral method. The computing work can be reduced and the results better than that by using traditional serial algorithm can be obtained.
出处
《华东船舶工业学院学报》
北大核心
2005年第3期61-64,共4页
Journal of East China Shipbuilding Institute(Natural Science Edition)
关键词
TSP
遗传算法
迁移策略
traveling salesman problem
genetic algorithm
migration strategy
