Title of article :
An ILPimprovementprocedurefortheOpenVehicleRoutingProblem
Author/Authors :
Majid Salari، نويسنده , , PaoloToth ، نويسنده , , AndreaTramontani، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Pages :
15
From page :
2106
To page :
2120
Abstract :
We addresstheOpenVehicleRoutingProblem(OVRP),avariantofthe‘‘classical’’(capacitatedand distance constrained)VehicleRoutingProblem(VRP)inwhichthevehiclesarenotrequiredtoreturnto the depotaftercompletingtheirservice.WepresentaheuristicimprovementprocedureforOVRPbased on IntegerLinearProgramming(ILP)techniques.Givenaninitialfeasiblesolutiontobepossibly improved,themethodfollowsadestruct-and-repairparadigm,wherethegivensolutionisrandomly destroyed(i.e.,customersareremovedinarandomway)andrepairedbysolvinganILPmodel,inthe attemptoffindinganewimprovedfeasiblesolution.Theoverallprocedurecanbeconsideredasa generalframeworkwhichcouldbeextendedtocoverothervariantsofVehicleRoutingProblems.We report computationalresultsonbenchmarkinstancesfromtheliterature.Inseveralcases,theproposed algorithmisabletofindthenewbestknownsolutionfortheconsideredinstances.
Keywords :
Local search , Heuristics , Integer linear programming , Open Vehicle Routing Problem
Journal title :
Computers and Operations Research
Serial Year :
2010
Journal title :
Computers and Operations Research
Record number :
927814
Link To Document :
بازگشت