预览加载中，请您耐心等待几秒...

求解多目标TSP问题的离散粒子群优化算法.docx

预览
1/3
2/3
3/3

在线预览结束，喜欢就下载吧，查找使用更方便

下载提示 文本预览

如果您无法下载资料，请参考说明：

1、部分资料下载需要金币，请确保您的账户上有足够的金币

2、已购买过的文档，再次下载不重复扣费

3、资料包下载后请先用软件解压，在使用对应软件打开

求解多目标TSP问题的离散粒子群优化算法 Introduction: TheTravelingSalesmanProblem(TSP)isoneofthemostwell-knownoptimizationproblemsinthefieldofcomputationalmathematics,anditinvolvesfindingtheshortestpossiblerouteforasalesmanwhoneedstovisitasetofcitiesandthenreturntohisstartingpoint.Overthelastfewdecades,manyresearchershavefocusedonTSPalgorithmdevelopmenttofindefficientsolutionsfordifferentvariations.Onesuchvariantisamulti-objectiveapproachtofindTSPproblems'routes,whichisknownastheMulti-objectiveTSP(MTSP).Theabilitytofindoptimizedroutesisessentialforbusinessesemployingsalesrepresentativesordeliveriesandeveninindustriessuchastransportationandlogistics.ThispaperaimstoproposeanovelalgorithmbasedonDiscreteParticleSwarmOptimization(DPSO)tosolveMTSPproblems. Background: TSPcanbestatedastheproblemoffindingaHamiltoniancycleortourforagivengraph.Thus,theTSPcanbeviewedasaproblemofoptimization:tofindtheshortestpathorthelowestcostpathamongasetofpossiblealternatives.Ontheotherhand,MTSPconsistsofmultipleobjectivefunctionswherethegoalistosimultaneouslyreducethetotaltraveldistanceandminimizetraveltimewhilesatisfyingallconstraints.Tosolvesuchproblems,onerequiresanalgorithmthatcanhandlemultipleobjectivefunctionssimultaneously. ParticleSwarmOptimization(PSO)isapopularalgorithmthatcanefficientlysolveoptimizationproblems.Itprovidesastraightforwardandintuitivewaytofindtheglobaloptimumofagivenproblembyiterativelyupdatingthepositionsofparticlesinahigh-dimensionalsearchspace.Theparticlesmoveandadjusttheirpositionsbasedontheirpastexperienceandthepositionsandvelocitiesofotherparticlesintheirneighborhood.Ontheotherhand,DPSOisanoptimizationtechniquethatusesadiscretesearchspaceandadjustsparticlepositionsbyselectingoneelementfromthesearchspaceinsteadofcontinuouslychangingpositionvalues. ProposedAlgorithm: TheproposedalgorithmisinspiredbyDPSOandaimstofindthebestHamiltoniancyclesinagraphwithmultipleobjectives.ThealgorithmstartsbydefiningthesearchspaceoftheMTSPproblem,whichisasequenceofnodesthatrepresentthecitiestobevisi