Title of article
A PathRelinkingapproachfortheTeamOrienteeringProblem
Author/Authors
Wouter Souffriau، نويسنده , , PieterVansteenwegenb، نويسنده , , GreetVandenBerghe، نويسنده , , DirkVanOudheusdenb، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
7
From page
1853
To page
1859
Abstract
This paperintroducesaPathRelinkingmetaheuristicapproachforsolvingtheTeamOrienteeringProblem
(TOP), aparticularroutingprobleminwhichascoreisearnedforvisitingalocation.Theobjectiveisto
maximise thesumofthescores,whilenotexceedingatimebudget Tmax for travellingtotheselected
locations. InthecaseofthesimpleOrienteeringProblem(OP),asinglerouteconnectingallselected
locations shouldbefollowed;inTOP m routes arerequiredandthelengthofeachrouteisrestrictedto
Tmax. Afastandaslowvariantoftheapproacharetestedusingalargesetoftestinstancesfromthe
literature; theyarecomparedtootherstate-of-the-artapproaches.Thefastvariantachievesanaverage
gap of0.39%tothebestknownsolutionsin5.0sofcalculationtime,whiletheslowvariantachieves
a 0.04%gapwithin272.8s.Moreover,nexttoachievingmostofthebestknownsolutionsformany
testproblems, theslowvariantimprovedthebestknownresultsinfiveinstances.
Keywords
Team orienteering problem , Path relinking , Metaheuristic
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927791
Link To Document