文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Ti
侵权投诉

An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Ti

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

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email