简介:TherearesomeadjustableparameterswhichdirecdyinfluencetheperformanceandstabilityofParticleSwarmOp-ttimizationalgorithm.Inthispaper,stabilitiesofPSOwithconstantparametersandtime-varyingparametersareanalyzedwithoutLipschitzconstraint.Necessaryandsufficientstabilityconditionsforaccelerationfactorψandinertiaweightwarepresented.Exper-imentsonbenchmarkfunctionsshowthegoodperfomanceofPSOsatisfyingthestabilitycondition,evenwithoutLipschitzcon-straint.Andtheinertiaweightwvalueisenhancedto(-1,1).
简介:TheproblemofpicksequencingintherotaryrackS/Rsystem(PPS-RRS)isinvestigatedwiththeobjectiveofminimizingtheexecutiontime.TherotaryrackS/RsystemconsistsofoneS/Rmachineandmultiplelevelsofcarouselsthatcanrotateindependentlyinbi-directions.Theroutingpolicy,namelythedecisiononthestorageorretrievalsequence,dominatestheefficiencyandthethroughputforsuchS/Rsystems,duetothecomplicatedrelationshipbetweenalllevelsofcarouselsandtheS/Rmachine.ForthepurposeofoptimizingthePPS-RRS,acomputationalmodelisdevelopedintermsofexecutiontimeforpickingmultipleitemsinonetrip.CharacteristicsofthePPS-RRSareanalyzedandalocalsearchheuristicbasedonanewlyproposedneighborhoodispresented.Integratedwiththeproposedlocalsearchprocedureanewhybridgeneticalgorithmisdeveloped.Experimentalresultsdemonstratethestructurecharacteristicsofgoodsequenceandtheefficiencyandeffectivenessoftheproposedsequencingalgorithms.
简介:Inmanyreal-worldapplicationsofevolutionaryalgorithms,thefitnessofanindividualrequiresaquantitativemeasure.Thispaperproposesaself-adaptivelinearevolutionaryalgorithm(ALEA)inwhichweintroduceanovelstrategyforevaluatingindividual'srelativestrengthsandweaknesses.Basedonthisstrategy,searchingspaceofconstrainedoptimizationproblemswithhighdimensionsfordesignvariablesiscompressedintotwo-dimensionalperformancespaceinwhichitispossibletoquicklyidentify'good'individualsoftheperformanceforamultiobjectiveoptimizationapplication,regardlessoforiginalspacecomplexity.Thisisconsideredasourmaincontribution.Inaddition,theproposednewevolutionaryalgorithmcombinestwobasicoperatorswithmodificationinreproductionphase,namely,crossoverandmutation.Simulationresultsoveracomprehensivesetofbenchmarkfunctionsshowthattheproposedstrategyisfeasibleandeffective,andprovidesgoodperformanceintermsofuniformityanddiversityofsolutions.
简介:AnewapproachforrobustH-infinityfilteringforaclassofLipschitznonlinearsystemswithtime-varyinguncertaintiesbothinthelinearandnonlinearpartsofthesystemisproposedinanLMIframework.TheadmissibleLipschitzconstantofthesystemandthedisturbanceattenuationlevelaremaximizedsimultaneouslythroughconvexmulti-objectiveoptimization.TheresultingH-infinityfilterguaranteesasymptoticstabilityoftheestimationerrordynamicswithexponentialconvergenceandisrobustagainstnonlinearadditiveuncertaintyandtime-varyingparametricuncertainties.Explicitboundsonthenonlinearuncertaintyarederivedbasedonnorm-wiseandelement-wiserobustnessanalysis.
简介:由认为城市的下水道网络的流动控制最小化抽水站的电消费,为精力积蓄的分解协作策略在这篇论文基于网络社区分割被开发。描绘城市的下水道网络的稳态流的一个数学模型首先被构造,由有作为限制捕获的结构交通能力的一套代数学的方程组成。因为下水道网络没一般来说有明显的自然层次结构,识别聚类的组是很困难的。通过计算每个边的between海角的一条快网络部门途径成功地被使用与任意的配置识别这些组和一个下水道网络然后能被分解成子网。由集成子网的联合限制,原来的问题根据网络分解被分开成N优化潜水艇问题。每个潜水艇问题局部地被解决,潜水艇问题的答案被协调形成一个适当全球答案。最后,到一个指定大规模下水道网络的一个应用程序也被调查表明建议算法的有效性。