Title of article
Efficient frameworksforgreedysplitandnewdepthfirstsearchsplit procedures forroutingproblems
Author/Authors
Christophe Duhamel، نويسنده , , PhilippeLacomme، نويسنده , , CarolineProdhon، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
17
From page
723
To page
739
Abstract
Split procedureshaveproventheirefficiencywithinglobaloptimizationframeworksforrouting
problemsbysplittinggianttoursintotrips.Thisisdonebygeneratinganoptimalshortestpathwithin
an auxiliarygraphconstructedfromthegianttour.Thisarticleprovidesastateoftheartofsplit
practice inroutingproblemsandgivesitskeyfeatures.Theefficiencyofthemethodcriticallydepends
on thenode-splittingprocedureandontheupperandlowerboundapproximations.Suitable
complexitycanbeobtainedusinganewdepthfirstsearchprocedurewhichisintroducedhereand
providesanewalgorithmthatisspeciallydesignedforlargescaleproblemswithresourceconstraints.
Experimentsshowthatthedepthfirstsearchsplitprocedureintroducedinthisarticle,usedasan
evaluationfunctioninaglobalframework,canimprovetheresultsobtainedbytheuseofthe‘‘classical’’
split procedureontheLocation-RoutingProblemandtheHeterogeneousVehicleRoutingProblem.The
Location-RoutingProblemisalsousedtoprovidefurtheranalysisandafaircomparativestudybetween
the twosplitversions.
Keywords
Location routing problem , Split , Routing problem
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927897
Link To Document