2、8!dC~)(h&;h&l+5<'8!dl+5(8!dl+5 x=[*81u~)eGl9a"rh,+sUDgTxTSP{;MMASEACSp`hl[*
3、#roxlh~1lVlgZ`h~)eGUDTSP{`ndTP18AntColonyOptimizationAlgorithmwithFiniteGradePheromoneKELiang-JunFENGZu-RenFENGYuan-Jing(SystemsEngineeringInstitute,StateKeyLaboratoryforManufacturingSystemsEngineering,Xi′anJiaotongUniversity,Xi′an710
4、049)(E-mail:kelj163@163.com)AbstractInthepaper,anewclassofantcolonyoptimizationalgorithmisproposed,inwhichpheromoneisclassifiedintofinitegrades,pheromoneupdatingisrealizedbychangingthegrades,andtheupdatedquantityofpheromoneisindependentoftheobjectivefunct
5、ionvalues.ItisprovedbymeansoffiniteMarkovchainstheorythatthealgorithmconvergestotheglobaloptimalsolutionslinearly.ComparedwithMMAS,ACSandsomeotherantcolonyoptimizationalgorithmsfortheTravelingSalesmanProblem,thecalculatingresultsdemonstratethatthepropose
6、dalgorithmiseffectiveandrobust.KeywordsAntcolonyoptimization,finiteMarkovchains,convergence,TravelingSales-manProblem1m[1]_f(ACO)fY