The Vehicle Routing Problem with Discrete

The Vehicle Routing Problem with Discrete

ID:38615514

大小:383.08 KB

页数:26页

时间:2019-06-16

The Vehicle Routing Problem with Discrete_第1页
The Vehicle Routing Problem with Discrete_第2页
The Vehicle Routing Problem with Discrete_第3页
The Vehicle Routing Problem with Discrete_第4页
The Vehicle Routing Problem with Discrete_第5页
资源描述:

《The Vehicle Routing Problem with Discrete》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、TheVehicleRoutingProblemwithDiscreteSplitDeliveriesandTimeWindowsIlariaVaccaTransportandMobilityLaboratory,EPFLjointworkwithMatteoSalaniSeminairedu3´emecycleromanddeRechercheOp`erationnelle´Zinal-January18,2010TheVehicleRoutingProblemwithDiscreteSplitDeliveriesandTi

2、meWindows–p.1/26Outline•Problemdescriptionandapplications•MILPformulationandColumngeneration•Branch-and-pricealgorithm•Computationalresults•ConclusionsandfurtherresearchTheVehicleRoutingProblemwithDiscreteSplitDeliveriesandTimeWindows–p.2/26TheVehicleRoutingProblem(

3、VRP)Given•setofcustomerswithdemandstobeserved(withintimewindows:VRPTW);•setofcapacitatedvehiclesavailableatasingledepot;DEPOTTheVehicleRoutingProblemwithDiscreteSplitDeliveriesandTimeWindows–p.3/26TheVehicleRoutingProblem(VRP)Objective•designtheoptimalminimum-costro

4、utesforvehicles,•suchthateverycustomerisvisitedexactlyonce.Route2Route3Route1DEPOTTheVehicleRoutingProblemwithDiscreteSplitDeliveriesandTimeWindows–p.4/26VRPwithSplitDeliveries(SDVRP)Splittabledemand•demandcanbesplitandthusservedbymorethanonevehicle;•customerscanbev

5、isitedmorethanonce.Route2Route3Route1DEPOTTheVehicleRoutingProblemwithDiscreteSplitDeliveriesandTimeWindows–p.5/26VRPwithDiscreteSplitDeliveries(DSDVRP)Demandisdiscretizedinitems•variantofVRPwith(continuous)splitdeliveries;•thedemandofeachcustomerisrepresentedbyaset

6、ofitems;•demandcanbesplitbutitemscannot.Demandisdeliveredincombinationsofitems•itemsaregroupedanddeliveredincombinations(subsetsofitems);•foreverycustomer,feasiblecombinationsofitemsarepredefinedandknown;•somecombinationsofitemsarenotallowed.Sierksma&Tijssen(1998);Na

7、kao&Nagamochi(2007);Cesellietal.(2009).TheVehicleRoutingProblemwithDiscreteSplitDeliveriesandTimeWindows–p.6/26DSDVRPwithTimeWindows(DSDVRPTW)Servicetimeisquantity-dependent•wedefineservicetimethetimeneededtoperformthedeliveryoncethevehicleisarrivedatcustomer’slocati

8、on;•inourmodel,servicetimedependsonthequantitydelivered;•inparticular,aspecificservicetimeisassociatedtoeveryfeasiblecombinationofitems;•we

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。