specific腾讯qq空间登录
腾讯qq空间登录 时间:2021-01-21 阅读:(
)
ResearchofImprovedAntColonyHybridAlgorithmLiShijun1,a,HanYu1,b,GuHongjun1,c,GongHe1,d,LiJian1,el1CollegeofInformation&Technology,JilinAgriculturalUniversity,Changchun130118,China.
a452835889@qq.
com,b372600730@qq.
com,c330837495@qq.
comd29878671@qq.
com,e2312852319@qq.
comKeywords:antcolonyalgorithm,immunealgorithm,artificialfishswarmalgorithm,hybridalgorithm.
Abstract.
Inordertoextendtheapplicationofantcolonyalgorithm(ACA),manyscholarscombinedtheantcolonyalgorithmwithimmunealgorithm(IA)orotheralgorithmstosolvetheproblemofslowconvergence.
Tofullysolvethetoolongsearchtime,easilyfallingintolocaloptimization,slowconvergenceandsomeotherdefects,theimmunealgorithmandartificialfishswarmalgorithm(AFSA)combinewiththeantcolonyalgorithm,andtheantcolonyhybridalgorithmisproposed.
Thenbysolvingthetravelingsalesmanproblem(TSP),thenewalgorithmissimulated,andtheresultsshowthatimprovingalgorithmiseffectiveandfeasible.
IntroductionTheantcolonyalgorithm(ACA)wasfirstproposedbyItalyscholarDorigoM.
andothersin1991,anovelsimulatedevolutionaryalgorithm,antssearchforapaththroughthesecretionofpheromonescatteredonitspath.
Thentheantsrandomlychoosearoadthatdidn'tpass,releasepheromoneaboutthelengthofthispath.
Buttheamountofinformationreleasedisinverselyproportionaltothelengthofthepath,whichlikelytochoosethepathofalargeramountofinformation,it'sapositivefeedbackmechanism.
Thebestpathistheamountofinformationthatisgettingbiggerandbigger,theamountofinformationontheotherpathisgraduallyreduced,antseventuallyfindoptimalpath.
Bysimulatingants'behaviorsuchasforaging,assignmentandbuildingthegraveyard,weputforwardACA.
It'seasytocombinewithotheralgorithms,andithasastrongrobustnessandexcellentdistributedcomputersystem,andit'seasytocombinewithotheralgorithms.
Thisalgorithmachievedgoodeffectintheacademicfield,theproblemssuchasfunctionoptimization,combinationoptimization,datamining,networkrouting,etc.
ACAbecameahotspotformanyscholarstoanalyzetheoptimizationalgorithm,ithasuniqueandwidelyabilitytosolveproblems.
Improvedthealgorithmitself,andcombinedwithotheralgorithms,appliedtomanyoftheactualfieldofwhich.
Basicprinciplesofantcolonyalgorithm)(tijtFirst,solvingtheTSPproblemasanexample,thespecificimplementationstepsofthebasicACAareasfollows.
Givingncitiesandtwoofthedistancebetweenthetwocities,therequirementstodetermineapassedthrougheachcityonlyonceintheshortestpath.
Inordertosimulatethebehaviorofrealants,weintroducedthefollowingnotation;misthenumberofants.
ijd(i,j=1,2,.
.
.
,n)representsthedistancebetweeniandjinthecity,representstheamountofinformationremainingonthepathbetweeniandjinthetcity,it'susedtosimulatethepheromoneconcentrationkallowedktabu)(tpkijoftheactualants.
.
Wheninitialized,mantswereplacedrandomlyondifferentcities,givingthe)0(ijτamountofinformationwasoneachside.
Eachantkofthatthefirstelementwasassignedtothecitywhereitwaslocated.
indicatethattheantkwastransferredfromcityitocityjprobabilitytime,usingformula(1).
indicatesthatantkallowstochosethecityinthenextstep;αasinformationheuristicfactor,indicatesrelativelocusimportance.
Itreflectsthatantsaccumulatedinformationinthemovementtoplaytherolefortheantmovement;βasexpectationheuristicfactor,indicatesrelativevisibilityimportance,itreflectstheimportancedegreeofheuristicinformationwhenantschosethepathinthemovement.
(1)0j,)()()()()(∈=∑∈elseallowediftttttpkallowedsisisijijkijk,ββηtηtAfternmoments,antkwalkedthroughallthecities,completedacycle.
Thenupdatedtheamountofinformationoneachpathbytheformula(2).
ijτ)2()()()1()(ttntijijijttρt+=+Among,calculatedbytheformula(3),itrepresentstheamountofinformationonthekantinthepath(i,j)intheloop.
Thecalculationmethodisbasedonthecalculationmodel,inthemostcommonlyusedAnt-Cyclemodel,usingformula(4),Qrepresentsthepheromoneintensity,itaffectstheconvergencerateofthealgorithmtosomeextent.
kLrepresentsthetotallengthofthepathofthekantinthiscycle.
(3))()(1∑==mkkijijtttt)4(otherwise,0),i(throughcycleinthisantsonlyKtheIf,)(=jLQtkkijtCombinationofantcolonyalgorithmandimmunealgorithm.
Thebasicideaofthecombinationofantcolonyalgorithmandimmunealgorithm.
CombingIAwithACA,usedACAtosolvetheproblemasantigen,andtheextractionofthevaccinetopheromoneinitialization,ACAproducedantibodiestoassignavaluetoaparameter,appliedtothesolutionofspecificproblems,theobtainedresultsasthecurrentantibodyfitnessvaluebyinoculationofvaccineIA,crossover,mutation,affinityselection,retainedtoadaptgoodantibody,eliminatedadaptationofantibody,theiterative,gottheantibodyinfinally,theparameterACAcombinationwasobtainedforthespecificproblem.
Algorithmbyupdatingbasedonaffinity,thuseffectivelypreventsthe'premature'problem,ledthesearchprocesstotheglobaloptimum.
Theinitialvalueofpheromonewasextractedbytheextractionmechanismofvaccine,avoidedtherandomnessoftheinitialsolution.
Byusingthevaccinationmechanism,crossoverandmutationtoacceleratetheconvergencespeed.
ACAandIAiscalledimmuneantcolonyalgorithm(IAACA).
Thebasicstepsoftheimmuneantcolonyalgorithm.
ImmuneantcolonyalgorithmflowchartisshowninFig.
1.
Fig.
1ImmunealgorithmflowchartCombinationofartificialfishswarmalgorithmandimmuneantcolonyalgorithmThebasicideaofthehybridalgorithm(AFSA-IAACA)basedonartificialfishswarmalgorithmandantcolonyimmunealgorithm.
AFSAhastheadvantagesoffastconvergencespeed,wewilladdedtoeveryiterativeprocessofimmuneantcolonyalgorithmtoacceleratetheconvergencespeedofantcolonyalgorithm,anddependingontheforagingbehaviorofAFSAtohelpimproveIAACAtojumpoutoflocaloptimum.
AFSA-IAACAfortheTSPproblemofadetailedimprovementstrategyandalgorithmdetailedsteps:Step1Attheinitialt=0,mantswererandomlyplacedinthencities,eachpathinitialpheromoneconcentrationis.
)0(constij=tStep2Antscalculatedtransferprobabilitybytheformula(1),selectedtoprojecttransitionpath.
Thencalculatedthepathcongestionatthattimeijqbytheformula(5).
If)(tqijδindicatedthatpathisnottoocrowded,antschosethepathtotransferfrompositionitopositionj.
Otherwise,thepathwastoocrowded,theantselectedapathoftransferinthefeasibleneighborhoodtorandomly.
Amongthem,)(tδiscongestionthresholdinttime,updatedtypebytheformula(6).
Amongthem,cisthethresholdcoefficientofvariation.
(5))()(2∑≠=jiijijijttqtt(6)1)(ctet=δStep3Afternmoment,thekantwentallCitiestocompleteacycle.
Thenupdatedtheinformationoneachpathbytheformula(2).
Step4Repeatedformula(1)and(2),untilthemantschosethesamepathorreachthespecifiedmaximum.
SimulationResultsandAnalysisTable1Comparisonofexperimentalresultsnumberofcities(ACA)(IAACA)(AFSA-IAACA)averageiterationnumberOptimumsolutionaverageiterationnumberOptimumsolutionaverageiterationnumberOptimumsolution101032.
708617982.
708617912.
70861730728423.
631000596423.
631000547423.
631000501465429.
543000962427.
865000715427.
653.
000752103569.
7830001421551.
649000892541.
443000TheresultsshowthattheAFSA-IAACAalgorithmproveditsfeasibility,effectivenessandconvergencebyapplicationandsimulationexperimentintheTSPproblem.
ThealgorithmwillAFSAaddedtoeachiterativeprocessofIAACA,takingadvantageofAFSAwithfastconvergencewhichacceleratetheconvergencespeedofACAandforagingbehaviorofAFSAcouldhelpimprovedtheabilityofACAtojumpoutoflocaloptimum.
Bydoingthis,wecanreducenotonlythenumberofinvalidsearch,butalsothealgorithmintothelocaloptimalsolution,improvetheabilityandconvergencespeedofthealgorithm.
ConclusionsACAhassomeproblems,suchasprematureconvergence,slowconvergence,thecombinationofACAandIAisaneffectivemethodtosolvethesedefects.
ThencombinetheIAACAandAFSAtosolvethesedefectsthatlongsearchtimeandeasilyfallintolocaloptimization,andtoimprovetheabilitytojumpextreme,andsignificantlyimprovetheaccuracyofthealgorithm.
ThesimulationexperimentwascarriedoutbysolvingtheTSPproblem,andresultsshowthattheimprovedalgorithmiseffectiveandfeasible.
AcknowledgmentsTheauthorswishtoexpresstheirgratitudetotheprojects:JilinProvinceEconomicStructuralAdjustmentLeadingFundSpecialProject(No.
2014Y108)andChangchunCityScienceandTechnologyPlanProject(No.
14nk029),KeyTacklingItemofJilinProvinceScience&TechnologyDepartment(No.
20140204045NY),DesignofStandardizedBreedingSystemforRabbitsBasedonInternetofThingsfromEducationDepartmentofJilinProvince,ChangchunCityScienceandTechnologyPlanProject(No.
13KG71),fortheirgeneroussupportofthiswork.
References[1]GuMingjia,XuanShibin,LianKanchao,etal.
QoSroutingalgorithmbasedoncombinationofmodifiedantcolonyalgorithmandartificialfishswarmalgorithm,Computertechnologyanddevelopment,2009,pp.
145-148.
[2]HeYijun,ChenDezhao.
Theconstructionandapplicationofantcolonyalgorithmformulti-objectiveoptimization,HightechnologyCommunication,Beijing,2006,pp.
1241-1245.
[3]CaiLijun,JiangLinbo,YiYeQing.
Geneselectionbasedonantcolonyoptimizationalgorithm,CalculationandApplicationResearch.
Beijing,2008,pp.
2754-2756.
[4]DuanHaibin.
Antcolonyalgorithmanditsapplication,SciencePress,Beijing,2005.
[5]DasguptaD.
Advancesinartificialimmunesystems,IEEEComputationalIntelligenceMagazine,Beijing,2006,pp.
40-49.
[6]JiangXinzi,TongKezong,GaoShang.
Hybridalgorithmofantcolonyalgorithmwithimmunealgorithm,ScienceTechnologyandEngineering,Beijing,2008,pp.
1328-1333.
提速啦的来历提速啦是 网站 本着“良心 便宜 稳定”的初衷 为小白用户避免被坑 由赣州王成璟网络科技有限公司旗下赣州提速啦网络科技有限公司运营 投资1000万人民币 在美国Cera 香港CTG 香港Cera 国内 杭州 宿迁 浙江 赣州 南昌 大连 辽宁 扬州 等地区建立数据中心 正规持有IDC ISP CDN 云牌照 公司。公司购买产品支持3天内退款 超过3天步退款政策。提速啦的市场定位提速啦主...
近日华纳云发布了最新的618返场优惠活动,主要针对旗下的免备案香港云服务器、香港独立服务器、香港高防御服务器等产品,月付6折优惠起,高防御服务器可提供20G DDOS防御,采用E5处理器V4CPU性能,10Mbps独享CN2 GIA高速优质带宽,有需要免备案香港服务器、香港云服务器、香港独立服务器、香港高防御服务器、香港物理服务器的朋友可以尝试一下。华纳云好不好?华纳云怎么样?华纳云服务器怎么样?...
近期联通CUVIP的线路(AS4837线路)非常火热,妮妮云也推出了这类线路的套餐以及优惠,目前到国内优质线路排行大致如下:电信CN2 GIA>联通AS9929>联通AS4837>电信CN2 GT>普通线路,AS4837线路比起前两的优势就是带宽比较大,相对便宜一些,所以大家才能看到这个线路的带宽都非常高。妮妮云互联目前云服务器开放抽奖活动,每天开通前10台享3折优惠,另外...
腾讯qq空间登录为你推荐
电脑桌面背景图片如何选到电脑桌面壁纸高清风景图316不锈钢和304哪个好请问316不锈钢和304不锈钢有什么区别?从外观如何辨别?锦天城和君合哪个好记忆棉和乳胶哪个好看书软件哪个好推荐几个好用的手机看书软件云盘哪个好云盘有哪些,哪个云盘好美国国际东西方大学美国大学一年学费是多少?美国国际东西方大学出国留学,美国“野鸡大学”有哪些?qq空间登录不了为什么我的QQ登陆不了QQ空间YunOSyunOS是手机里的什么软件系统啊?东莞电信宽带套餐广东东莞电信宽带资费是怎么样的?
国外服务器租用 国际域名抢注 北京vps 草根过期域名 高防dns 赵容 godaddy续费优惠码 回程路由 搜狗抢票助手 linux空间 国外免费全能空间 域名和空间 空间技术网 域名dns 跟踪路由命令 西安服务器托管 美国凤凰城 web应用服务器 申请免费空间 黑科云 更多