The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods from a pickup location to a delivery location. Our task is to
AnAdaptiveLargeNeighborhoodSearchHeuristicforthePickup
andDeliveryProblemwithTimeWindows
StefanRopke,DavidPisinger
8thAugust2005
Abstract
Thepickupanddeliveryproblemwithtimewindowsistheproblemofservinganumberoftransportationrequestsusingalimitedamountofvehicles.Eachrequestinvolvesmovinganumberofgoodsfromapickuplocationtoadeliverylocation.Ourtaskistoconstructroutesthatvisitalllocationssuchthatcorrespondingpickupsanddeliveriesareplacedonthesamerouteandsuchthatapickupisperformedbeforethecorrespondingdelivery.Theroutesmustalsosatisfytimewindowandcapacityconstraints.
ThispaperpresentsaheuristicfortheproblembasedonanextensionoftheLargeNeighborhoodSearchheuristicpreviouslysuggestedforsolvingthevehicleroutingproblemwithtimewindows.Theproposedheuristiciscomposedofanumberofcompetingsub-heuristicswhichareusedwithafrequencycorrespond-ingtotheirhistoricperformance.ThisgeneralframeworkisdenotedAdaptiveLargeNeighborhoodSearch.Theheuristicistestedonmorethan350benchmarkinstanceswithupto500requests.Itisabletoimprovethebestknownsolutionsfromtheliteratureformorethan50%oftheproblems.
Thecomputationalexperimentsindicatethatitisadvantageoustouseseveralcompetingsub-heuristicsinsteadofjustone.Webelievethattheproposedheuristicisveryrobustandisabletoadapttovariousinstancecharacteristics.
Keywords:PickupandDeliveryProblemwithTimeWindows,LargeNeighborhoodSearch,SimulatedAnnealing,Metaheuristics
Introduction
Intheconsideredvariantofthepickupanddeliveryproblemwithtimewindows(PDPTW),wearegivenanumberofrequestsandvehicles.Arequestconsistsofpickingupgoodsatonelocationanddeliveringthesegoodstoanotherlocation.Twotimewindowsareassignedtoeachrequest:apickuptimewindowthatspeci eswhenthegoodscanbepickedupandadeliverytimewindowthattellswhenthegoodscanbedroppedoff.Furthermoreservicetimesareassociatedwitheachpickupanddelivery.Theservicetimesindicatehowlongitwilltakeforthepickupordeliverytobeperformed.Avehicleisallowedtoarriveatalocationbeforethestartofthetimewindowofthelocation,butthevehiclemustthenwaituntilthestartofthetimewindowbeforeinitiatingtheoperation.Avehiclemayneverarrivetoalocationaftertheendofthetimewindowofthelocation.
Eachrequestisassignedasetoffeasiblevehicles.Thiscanforexamplebeusedtomodelsituationswheresomevehiclescannotenteracertainlocationbecauseofthedimensionsofthevehicle.
Eachvehiclehavealimitedcapacityanditstartsandendsitsdutyatgivenlocationscalledstartandendterminals.Thestartandendlocationdonotneedtobethesameandtwovehiclescanhavedifferentstartandendterminals.Furthermoreeachvehicleisassignedastartandendtime.Thestarttimeindicateswhenthevehiclemustleaveitsstartlocationandtheendtimedenotesthelatestallowablearrivalatitsendlocation.Notethatthevehicleleavesitsdepotatthespeci edstarttimeeventhoughthismayintroduceawaitingtimeatthe rstlocationvisited.
Ourtaskistoconstructvalidroutesforthevehicles.Arouteisvalidiftimewindowsandcapacitycon-straintsareobeyedalongtheroute,eachpickupisservedbeforethecorrespondingdelivery,corresponding
An Adaptive Large Neighb... 30页 免费 Data Clustering using La... 暂无...and we propose a large neighborhood search heuristic to make it tractable. ...
for the Vehicle Routing Problem with Simultaneous Pickup and Delivery Marcone...(2006) developed a heuristic inspired on the Large o Neighborhood Search (...
Finally, the actual pickup and delivery service in ?ight ticked sales ...An adaptive large neighborhood search heuristic for the cumulative capacitated ...
A New Heuristic Approach for the One-Commodity Pickup-and-Delivery Traveling...Instead, we combine several operators in a Variable Neighborhood Search scheme...
A Metaheuristic for the Pickup and Delivery ...: neighborhood of solution S obtained by PD-...heuristic contains large number of vehicles, the ...
heuristic algorithm only if the larger neighborhood can be searched in a ... An Adaptive Large Neig... 30页 免费 喜欢此文档的还喜欢 航班延误与时刻...
Heuristic methods (Pisinger, R?pke) 1 2 Adaptive Large Neighborhood Search ...open VRP (OVRP) Rich Pickup and Delivery Problem with time windows ? ...
An Adaptive Large Neighb... 30页 免费 Forward pruning and othe... 暂无... Oscillation, Heuristic Ordering and Pruning in Neighborhood Search Jean-Marc ...
Adaptive heuristic search algorithm for discrete ...algorithms have an offline neighborhood structure. ...large strains, high strain rate, and temperatures...
solution in a neighborhood N ( si ) of si .... and an efficient tabu search heuristic is ...Solving the pickup and delivery problem with time...
热门文档