资 源 简 介
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.
