Title of article
The multi-shiftvehicleroutingproblemwithovertime
Author/Authors
Yingtao Ren، نويسنده , , MagedDessouky ، نويسنده , , FernandoOrdo´n?ez، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
12
From page
1987
To page
1998
Abstract
In thispaper,westudyanewvariantofthevehicleroutingproblem(VRP)withtimewindows,multi-
shift, andovertime.Inthisproblem,alimitedfleetofvehiclesisusedrepeatedlytoservedemandovera
planninghorizonofseveraldays.Thevehiclesusuallytakelongtripsandtherearesignificantdemands
near shiftchanges.Theproblemisinspiredbyaroutingprobleminhealthcare,wherethevehicles
continuouslyoperateinshifts,andovertimeisallowed.Westudywhetherthetradeoffbetween
overtimeandotheroperationalcostssuchastravelcost,regulardriverusage,andcostofunmet
demandscanleadtoamoreefficientsolution.Wedevelopashiftdependent(SD)heuristicthattakes
overtimeintoaccountwhenconstructingroutes.WeshowthattheSDalgorithmhassignificantsavings
in totalcostaswellasthenumberofvehiclesoverconstructingtheroutesindependentlyineachshift,
in particularwhendemandsareclusteredornon-uniform.LowerboundsareobtainedbysolvingtheLP
relaxationoftheMIPmodelwithspecializedcuts.ThesolutionoftheSDalgorithmonthetestproblems
is within1.09–1.82timestheoptimalsolutiondependingonthetimewindowwidth,withthesmaller
time windowsprovidingthetighterbounds.
Keywords
Multi-shift , Overtime , Insertion heuristic , Tabu search , Vehicle routing problem with time windows (VRPTW)
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927804
Link To Document