Title of article
Heuristics fortheruralpostmanproblem
Author/Authors
Kaj Holmberg، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
10
From page
981
To page
990
Abstract
When addressingtheproblemofsnowremovalforsecondaryroads,atoolforsolvingtheruralpostman
problem canbeveryuseful.Wepresentsomeideasforheuristicsforthisproblem.Theheuristicsareof
the sametypeastheclassicalFredericksonheuristic.Theideasconcerntheorderofthemainstepsin
such amethod,namelyconstructingaconnectedgraphwithallverticeshavingevendegree,containing
all therequirededges.Wealsoproposetwopostprocessingheuristicsforimprovingthetoursandre-
moving unnecessarydetours.Thecomputationaltestsshowthattheideasareinterestingalternativesto
the classicalapproach,andthatrunningtimesareacceptable.Westudyproblemcharacteristicsthatmay
indicate whichmethodtochoose.
Keywords
Heuristics , Rural Postman Problem , Snow removal
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927707
Link To Document