Title of article :
A HybridMulti-SwarmParticleSwarmOptimizationalgorithmfortheProbabilistic
Traveling SalesmanProblem
Author/Authors :
Yannis Marinakis، نويسنده , , MagdaleneMarinakib، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
The ProbabilisticTravelingSalesmanProblem(PTSP)isavariationoftheclassicTravelingSalesman
Problem (TSP)andoneofthemostsignificantstochasticroutingproblems.InthePTSP,onlyasubsetof
potential customersneedtobevisitedonanygiveninstanceoftheproblem.Thenumberofcustomers
to bevisitedeachtimeisarandomvariable.Inthispaper,anewhybridalgorithmicnatureinspired
approach basedonParticleSwarmOptimization(PSO),GreedyRandomizedAdaptiveSearchProcedure
(GRASP) andExpandingNeighborhoodSearch(ENS)StrategyisproposedforthesolutionofthePTSP.
The proposedalgorithmistestedonnumerousbenchmarkproblemsfromTSPLIBwithverysatisfactory
results. ComparisonswiththeclassicGRASPalgorithm,theclassicPSOandwithaTabuSearchalgorithm
are alsopresented.Also,acomparisonisperformedwiththeresultsofanumberofimplementations
of theAntColonyOptimizationalgorithmfromtheliteratureandin13outof20casestheproposed
algorithm givesanewbestsolution.
Keywords :
Metaheuristics , Expanding Neighborhood Search-GRASP , Particle swarm optimization , Probabilistic Traveling Salesman Problem
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
