蚁群算法中参数设置的研究

22120081()JournalofShandongUniversityofTechnology(NaturalScienceEdition)Vol.22No.1Jan.2008:1672-6197(2008)01-0007-05,,,(,264005):,,anent,.(TSP),,,.:;;;:TP301.6:ATheresearchontheparametersoftheantcolonyalgorithmXUHong2mei,CHENYi2bao,LIUJia2guang,WANGYan2tao(SchoolofElectromechanicalAutomobileEngineering,YantaiUniversity,Yantai264005,China)Abstract:AntColonyAlgorithmisanewstochasticoptimizationalgorithmusingartificialantsre2leasingpheromoneonthepath,characterizedwithapositivefeedback,distributedcomputation,multi2agentsynergyandparallelalgorithm.Theparametershaveanimportantroleintheresultofantcolonyalgorithm.TheprincipleandmodelofAntColonyAlgorithmwereintroducedandrea2sonableexperimentswerecarriedoutontheparametersofthisalgorithm,includingbasicprinciplesfortheparameterselection,whicharebeneficialtotheapplicationanddevelopmentoftheantcolonyalgorithminoptimizationproblems.Keywords:antcolonyalgorithm;pheromone;combinatorialoptimization;TSP(travelingsalesmanproblem)(biologysocialsystem)[1],,.(antcolonyalgorithm)(particleswarmoptimization,PSO).Dorigo.M2090[2],,,[3],:2007209210:(50465001);(2006BS05008):(19822),,.©1994-2008ChinaAcademicJournalElectronicPublishingHouse.Allrightsreserved.[4],,.,.11.1,..,(pheromone,),.,,.,:,.1[2].1(a),Nest()Food(),Obstacle(),,1(b).,,.,,,1(c).,,,,,,,1(d).(a)(b)(c)(d)11.2ASnTSP.nTSPn,,,,.:m,dij(i,j,,n)ij,ij(t)tij.,,ij(0)=C(C).k(k=1,2,,n),,pkij(t)tkij;tabuk(k=1,2,,n)k,tabuk,k,,tabuk.ij,,1/dij,dijij;,;,.sk;alloweddkk.pkij(t)8()2008©1994-2008ChinaAcademicJournalElectronicPublishingHouse.Allrightsreserved.(t)=[ij(t)][ik(t)]salloweddk[is(t)][is(t)],jallowedk0,(1),n(),(2).ij(t+n)=(1-)ij(t)+tij(t)ij(t)=mk=1kij(t)(2),,1-,[0,1);ij(t)(i,j),ij(0)=0;kijk(i,j).M.Dorigo3[1],AntCycleSystem,AntQuantitySystem,AntDensitySystem,kij.Ant2Cycle:kij(t)=QLk,k(i,j)0,,Q,;Lkk.Ant2Quantity:kij(t)=Qdij,ktt+1(i,j)0,Ant2Density:kij(t)=Q,ktt+1(i,j)0,Ant2Cycle,,.,Ant2Cycle.2.,,;,,,[526].eil51TSP,Ant2Cycle.,m=32,=1,=4,=0.5,Q=100,1000,,,20,.2.1,[7].,,,,,,;,,,0,,,,.2.2m2,m=30,,,,.,.,m=[0.6n,0.9n].91,:©1994-2008ChinaAcademicJournalElectronicPublishingHouse.Allrightsreserved.[1.0,2.0],.2.3,.,,,.4.44,,,;,.,[4.0,6.0],.2.4[8],,,,;,,,,.5.55,[0.5,0.8],,.2.5Ant2Cycle,Q.,Q,[9].6Q.6Q6,Q700,,.01()2008©1994-2008ChinaAcademicJournalElectronicPublishingHouse.Allrightsreserved.[2].Ant2Cycle,eil51TSP,,,.,:m=[0.6n,0.9n],[1.0,2.0],[4.0,6.0],[0.5,0.8],Q=100.,,,..:[1],.[J].,2006,21(2):30231.[2]ColorniA,DorigoM,ManiezzoV,etal.Distributedoptimi2zationbyantcolonies[C]//DorigoM.Proceedingsofthe1stEuropeanConferenceonArtificialLife.Paris:ElsevierPub2lishing,1991:134242.[3]DorigoM,ManiezzoV,ColorniA.Antsystem:optimiza2tionbyacolonyofcooperatingagents[J].IEEETransactiononSystems,Man,andCybernetics2PartB,1996,26(1):29(1).[4]DorigoM,GambardellaLM.Antcoloniesforthetravelingsalesmanproblem[J].BioSystems.1997,43(2):73281.[5]ChangHS.Anantsystembasedexploration2exploitationforreinforcementlearning[C]//HyeongSo0Chang.Proceed2ingsofthe2004IEEEInternationalConferenceonSystems,ManandCybernetics.Seoul,Korea,2004,4:380523810.[6],.[J].,2004,33(2):2412244.[7].[M].:,2005.[8],.[J].,2002,14(1):31233.[9],.[J].,2002,31(3):1982201.111,:©1994-2008ChinaAcademicJournalElectronicPublishingHouse.Allrightsreserved.