蚁群算法-解决对称旅行商问题,算法好，发表国际期刊
代码说明：
Foradynamictravelingsalesmanproblem(DTSP),theweights(ortravelingtimes)betweentwocities(ornodes)maybesubjecttochanges.Antcolonyoptimization(ACO)algorithmshaveprovedtobepowerfulmethodstotacklesuchproblemsduetotheiradaptationcapabilities.Ithasbeenshownthattheinte-grationoflocalsearchoperatorscansignificantlimprovetheperformanceofACO.Inthispaper,amemeticACOalgorithm,wherealocalsearchoperator(calledunstringandstring)isintegratedintoACO,isproposedtoaddressDTSPs.ThebestsolutionfromACOispassedtothelocalsearchoperator,whichremovesandinsertscitiesinsuchawaythatimprovesthesolu-tionquality.TheproposedmemeticACOalgorithmisdesignedtoaddressbothsymmetricandasymmetricDTSPs.Theexperimen-talresultsshowtheefficiencoftheproposedmemeticalgorithmforaddressingDTSPsincomparisonwithotherstate-of-the-artalgorithms.
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
