Title of article
Metaheuristicsforthewastecollectionvehicleroutingproblemwithtime windows, driverrestperiodandmultipledisposalfacilities
Author/Authors
A.M. Benjamin، نويسنده , , J.E.Beasley ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
11
From page
2270
To page
2280
Abstract
In thisproblemthereisasetofwastedisposalfacilities,asetofcustomersatwhichwasteiscollected
and anunlimitednumberofhomogeneousvehiclesbasedatasingledepot.Emptyvehiclesleavethe
depot andcollectwastefromcustomers,emptyingthemselvesatthewastedisposalfacilitiesasand
when necessary.Vehiclesreturntothedepotempty.Wetakeintoconsiderationtimewindows
associatedwithcustomers,disposalfacilitiesandthedepot.Wealsohaveadriverrestperiod.The
problemissolvedheuristically.Aneighboursetisdefinedforeachcustomerasthesetofcustomers
that areclose,butwithcompatibletimewindows.Aprocedurethatattemptstofullyutiliseavehicleis
used toobtainaninitialsolution,withthisinitialsolutionbeingimprovedusinganinterchange
procedure.Wepresenttwometaheuristicalgorithmsusingtabusearchandvariableneighbourhood
search thatarebasedaroundtheneighboursets.Wealsopresentametaheuristicbasedonvariable
neighbourhoodtabusearch,wherethevariableneighbourhoodissearchedviatabusearch.
Computationalresultsarepresentedforpubliclyavailablewastecollectionproblemsinvolvingupto
2092 customersand19wastedisposalfacilities,whichindicatethatouralgorithmsproducebetter
quality solutionsthanpreviousworkpresentedintheliterature.
Keywords
Waste collection , vehicle routing , Variable Neighbourhood Search , Tabu search , Variable neighbourhood tabu search
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927828
Link To Document