时间窗约束下的车辆路径问题遗传算法【外文翻译】

时间窗约束下的车辆路径问题遗传算法【外文翻译】

ID:453736

大小:48.00 KB

页数:9页

时间:2017-08-04

时间窗约束下的车辆路径问题遗传算法【外文翻译】_第1页
时间窗约束下的车辆路径问题遗传算法【外文翻译】_第2页
时间窗约束下的车辆路径问题遗传算法【外文翻译】_第3页
时间窗约束下的车辆路径问题遗传算法【外文翻译】_第4页
时间窗约束下的车辆路径问题遗传算法【外文翻译】_第5页
资源描述:

《时间窗约束下的车辆路径问题遗传算法【外文翻译】》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、外文翻译原文GeneticAlgorithmsfortheVehicleRoutingProblemwithTimeWindowsMaterialSource:SpecialissueonBioinformaticsandGeneticAlgorithmsAuthor:OlliBräysy1IntroductionVehicleRoutingProblems(VRP)areallaroundusinthesensethatmanyconsumerproductssuchassoftdrinks,beer,bread,snackfoods,gasolinea

2、ndpharmaceuticalsaredeliveredtoretailoutletsbyafleetoftruckswhoseoperationfitsthevehicleroutingmodel.Inpractice,theVRPhasbeenrecognizedasoneofthegreatsuccessstoriesofoperationsresearchandithasbeenstudiedwidelysincethelatefifties.Publicservicescanalsotakeadvantageofthesesystemsinor

3、dertoimprovetheirlogisticschain.Garbagecollection,ortowncleaning,takesaneverincreasingpartofthebudgetoflocalauthorities.Atypicalvehicleroutingproblemcanbedescribedastheproblemofdesigningleastcostroutesfromonedepottoasetofgeographicallyscatteredpoints(cities,stores,warehouses,schoo

4、ls,customersetc).Theroutesmustbedesignedinsuchawaythateachpointisvisitedonlyoncebyexactlyonevehicle,allroutesstartandendatthedepot,andthetotaldemandsofallpointsononeroutemustnotexceedthecapacityofthevehicle.TheVehicleRoutingProblemwithTimeWindows(VRPTW)isageneralizationoftheVRPinv

5、olvingtheaddedcomplexitythateverycustomershouldbeservedwithinagiventimewindow.AdditionalcomplexitiesencounteredintheVRPTWarelengthofrouteconstraintarisingfromdepottimewindowsandcostofwaitingtime,whichisincurredwhenavehiclearrivestooearlyatacustomerlocation.Specificexamplesofproble

6、mswithtimewindowsincludebankdeliveries,postaldeliveries,industrialrefusecollection,school-busroutingandsituationswherethecustomermust provideaccess,verification,orpaymentupondeliveryofthe productorservice[SolomonandDesrosiers,1988].Besidesbeingoneofthemostimportantproblemsofoperat

7、ionsresearchinpracticalterms,thevehicleroutingproblemisalsooneofthemostdifficultproblemstosolve.Itisquiteclosetooneofthemostfamouscombinatorialoptimizationproblems,theTravelingSalespersonProblem(TSP),whereonlyonepersonhastovisitallthecustomers.TheTSPisanNP-hardproblem.Itisbelieved

8、thatonemayneverfindacomputational

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

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

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