Title of article
Variable neighborhoodsearchforthedial-a-rideproblem
Author/Authors
Sophie N.Parragh ، نويسنده , , KarlF.Doerner، نويسنده , , RichardF.Hartl، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
10
From page
1129
To page
1138
Abstract
In dial-a-rideproblemspassengershavetobetransportedbetweenpre-specifiedpickupanddelivery
locationsunderuserinconvenienceconsiderations.Theproblemvariantconsideredinthispaperaims
at minimizingtotalroutingcostswhilerespectingmaximumroutedurationlimits,timewindows,and
maximumuserridetimelimits.Weproposeacompetitivevariableneighborhoodsearch-based
heuristic,usingthreeclassesofneighborhoods.Thefirstneighborhoodclassusessimpleswap
operations tailoredtothedial-a-rideproblem;thesecondneighborhoodclassisbasedontheejection
chain idea;andthethirdneighborhoodclassexploitstheexistenceofarcswherethevehicleloadis
zero, givingrisetonaturalsequencesofrequests.Wereportnewbestresultsfor16outof20benchmark
instances.
Keywords
Transportation , Metaheuristic , Variable neighborhood search , Dial-a-Ride Problem
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927722
Link To Document