|
问题：求英语专业高手修改论文摘要,非诚勿扰/我改很多遍了,老师还是说语法不行旅行商问题(TravelingSalesmanProblem,简记为TSP)是一个组合优化领域典型的NP-hard问题,其求解时间随问题规模呈指数级
答案：↓↓↓ 刘宝英的回答： 网友采纳 添改了一些词,有几个句子稍微改了一下顺序,有的变为从句连贯些,供参考~ TravelingSalesmanProblem（TSP）isatypicalNP-hardproblemincombinatorialoptimizationfield,ofwhichthesolutiontimeisexponentialwiththeincreaseoftheproblemscale.Sincetraditionaloptimizationalgorithmfailstomeetdemand,whatbasedonintelligentalgorithmsforTSPhasbeenahottopicinrecentyears. SimulatedannealingalgorithmisarandomiterativeoptimizationalgorithmthatcombinesthephysicalannealingprocessandCombinatorialOptimization,whichconvergestotheoveralloptimalsolutionbyMetropoliscriteria.UsingSimulatedannealingalgorithmtosolvetheTSPproblemisanidealmethod. ThisdesignusessimulatedannealingalgorithmtosolveTSPproblem,andhasmadedesignsofthecity'spositionanditsalgorithmrules,accordingtothecharacteristicsofTSPproblemandsimulatedannealingalgorithm.AbasicwindowisconstructedbasedonC++,whichhasdefinedrandomcitypositionsinthewindow.Atthesametime,neighborhoodsearchmethodsandtheCalculationofPathdifferencearedesignedtospeedupalgorithmspeed.Experimentaltestresultsshowthatthisdesignhasachievedgoodeffects. | 
