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.

819云互联(800元/月),香港BGP E5 2650 16G,日本 E5 2650 16G

819云互联 在本月发布了一个购买香港,日本独立服务器的活动,相对之前的首月活动性价比更高,最多只能享受1个月的活动 续费价格恢复原价 是有些颇高 这次819云互联与机房是合作伙伴 本次拿到机房 活动7天内购买独立服务器后期的长期续费价格 加大力度 确实来说这次的就可以买年付或者更长时间了…本次是5个机房可供选择,独立服务器最低默认是50M带宽,不限制流量,。官网:https://ww...

日本CN2独立物理服务器 E3 1230 16G 20M 500元/月 提速啦

提速啦的来历提速啦是 网站 本着“良心 便宜 稳定”的初衷 为小白用户避免被坑 由赣州王成璟网络科技有限公司旗下赣州提速啦网络科技有限公司运营 投资1000万人民币 在美国Cera 香港CTG 香港Cera 国内 杭州 宿迁 浙江 赣州 南昌 大连 辽宁 扬州 等地区建立数据中心 正规持有IDC ISP CDN 云牌照 公司。公司购买产品支持3天内退款 超过3天步退款政策。提速啦的市场定位提速啦主...

Stablehost 美国主机商黑五虚拟主机四折

如今我们网友可能较多的会选择云服务器、VPS主机,对于虚拟主机的话可能很多人不会选择。但是我们有些外贸业务用途的建站项目还是会有选择虚拟主机的。今天看到的Stablehost 商家虚拟主机在黑五期间也有四折优惠,对于这个服务商而言不是特别的喜欢,虽然他们商家和我们熟悉的老鹰主机商有些类似,且在后来老鹰主机改版和方案后,Stablehost 商家也会跟随改版,但是性价比认为不如老鹰主机。这次黑色星期...

腾讯qq空间登录为你推荐
视频制作软件哪个好我想学做视频跟作图,推荐下什么软件好杀毒软件哪个好什么杀毒软件最好?华为p40和mate30哪个好Huawei Mate30 和 P40 哪个好?音乐播放器哪个好音乐播放器哪个最好用浮动利率和固定利率哪个好对于企业来说固定利率贷款与浮动利率贷款优缺点各是什么?谢谢了。宝来和朗逸哪个好朗逸和宝来那个比较好些各方面杰士邦和杜蕾斯哪个好杜蕾斯好用还是杰士邦好要?手机管家哪个好最好的手机管家oppo和vivo哪个好vivo好还是oppo手机好呢?雅思和托福哪个好考托福、雅思哪个好考?
哈尔滨域名注册 二级域名查询 域名商 winscp bandwagonhost 网通服务器ip hnyd vip购优惠 重庆双线服务器托管 国外ip加速器 超级服务器 网站加速软件 lick 电信网络测速器 日本代理ip 七十九刀 shuangcheng winserver2008 WHMCS nic 更多