一种新的动态TSP模型及其求解方法.pdf

and ComputerEngineeringApplications计算机工程与应用 ◎学术探讨◎ 一种新的动态TSP模型及其求解方法 肖桂霞，郑金华 XIAOGui—xia。ZHENG Jin—hua 湘潭大学信息工程学院，湖南湘潭411105 InstituteofInformation 411 105，China Engineering，XiangtanUniversity，Xiangtan，Hunan 26．con E-mail：xgx800805@1 andits XIAOGui-xia。ZHENGJin-hua．NewTSPmodel and dynamic solution．ComputerEngineering 2008．44(3)：34—38． salesman is aclassicalNP-hard andmethodsexistedinthis Abstract：The area， traveling problem problem．Manyalgorithms from in of howevermostofthemareusedtosolvestatic whicharemuchdifferent environmentreal problems problemsdynamic world．Sothe SalesmanProblem(DTSP)isanewresearchareawhereresearcherswillconcentrateonuseful DynamicTraveling modelsandmethodsof TSP．Inthis anewmodelfor TSPcalledDTSPbasedonGauss paper，we practical practical proposed we an to the and the disturbance．Also inver_over designedalgorithmresponddynamicchangeimproved operator．The resultsshowedthatournewmodelis usefulfor andthe iseffective． practicalproblem algorithm evolution；TSP；DTSP；evolution disturbance Keywords：dynamic；dynamic computation；geneticalgorithm；Gauss 法，并对反序交叉算子做了改进。实验证明该算法的有效性和新模型的现实意义。 关键词：动态；动态进化；TSP；DTSP；进化计算；遗传算法；高斯扰动 文献标识码：A 文章编号：1002—8331(2008)03—0034—05中图