Title of article :
The balancedtravelingsalesmanproblem
Author/Authors :
John Larusic ، نويسنده , , AbrahamP.Punnen، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
In thispaperweintroducethebalancedtravelingsalesmanproblem(BTSP),whichcanbeusedtomodel
optimizationproblemswhereequitabledistributionofresourcesareimportant.BTSPisobviouslyNP-
hard. Efficientheuristicalgorithmsarepresentedtosolvetheproblemalongwithextensive
computationalresultsusingbenchmarkproblemsfromTSPLIBandrandominstances.Ouralgorithms
producedprovablyoptimalsolutionsforseveraltestinstances.Applicationofthemodelinsolvingthe
nozzleguidevaneassemblyproblemrelatedtothemaintenanceofaircraftenginesisalsodiscussed.
Keywords :
Traveling salesman problem , Balanced optimization , Complexity , Heuristics , Experimental analysis
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
