Title of article :
A MemeticAlgorithmwithalargeneighborhoodcrossoveroperatorforthe
Generalized TravelingSalesmanProblem
Author/Authors :
Boris Bontoux، نويسنده , , ChristianArtiguesb، نويسنده , , DominiqueFeilletc، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
The GeneralizedTravelingSalesmanProblem(GTSP)isageneralizationofthewell-knownTraveling
Salesman Problem(TSP),inwhichthesetofcitiesisdividedintomutuallyexclusiveclusters.Theobjec-
tive oftheGTSPconsistsinvisitingeachclusterexactlyonceinatour,whileminimizingthesumofthe
routing costs.ThispaperaddressesthesolutionoftheGTSPusingaMemeticAlgorithm.Theoriginalityof
our approachrestsonthecrossoverprocedurethatusesalargeneighborhoodsearch.Thisalgorithmis
compared withotheralgorithmsonasetof54standardtestproblemswithupto217clustersand1084
cities. Resultsdemonstratetheefficiencyofouralgorithminbothsolutionqualityandcomputationtime.
Keywords :
Genetic Algorithm , Traveling salesman problem , Large neighborhood search
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
