2007-Efficient evolutionary algorithm for the vehicle routing problem版本

2007-Efficient evolutionary algorithm for the vehicle routing problem版本

ID:40373426

大小:370.11 KB

页数:8页

时间:2019-08-01

2007-Efficient evolutionary algorithm for the vehicle routing problem版本_第1页
2007-Efficient evolutionary algorithm for the vehicle routing problem版本_第2页
2007-Efficient evolutionary algorithm for the vehicle routing problem版本_第3页
2007-Efficient evolutionary algorithm for the vehicle routing problem版本_第4页
2007-Efficient evolutionary algorithm for the vehicle routing problem版本_第5页
资源描述:

《2007-Efficient evolutionary algorithm for the vehicle routing problem版本》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、Ef¿cientEvolutionaryAlgorithmfortheVehicleRoutingProblemwithTimeWindows:EdgeAssemblyCrossoverfortheVRPTWYuichiNagataAbstract²Weproposeanevolutionaryalgorithm(EA)forbenchmarks.Thiscrossoverwasdesignedbyextendingedgethevehicleroutingproblemwithtimewindows(VRPT

2、W).Inassemblycrossover(EAX)[14][15],whichwasoriginallyparticular,acrossoveroperatorsuitableforsolvingtheVRPTWdesignedforthetravelingsalesmanproblem(TSP).arepresented.TheproposedcrossoverisdesignedbyextendingInthisresearch,wefurtherapplyEAXtotheVRPTW.edgeasse

3、mblycrossover(EAX)whichwasoriginallydesignedforthetravelingsalesmanproblem(TSP).Moreover,weproposeHowever,wefoundthatEAXdesignedfortheCVRPisnotanef¿cientmodi¿cationproceduretoeliminateviolationsofappropriateforsolvingtheVRPTWbecausethiscrossoverthecapacityco

4、nstraintsandthetimewindowconstraintsgeneratesinfeasiblesolutions(children)thatseriouslyviolatebecauseintermediatesolutionsgeneratedbyEAXviolatethesethetimewindowconstraint(thecapacityconstraintisalsoconstraints.TheEAiscomposedofEAX,themodi¿cationviolated).So

5、,wefurtherextendEAXtotheVRPTWsoprocedureandaverysimplelocalsearch.TheEAisappliedtothewell-knownGeringandHombergerbenchmarksforthethatchildrentendnottoviolatethetimewindowconstraint.VRPTW.TheEA¿ndsnewbest-knownsolutionsin119oftheMoreover,wealsoproposeanadditi

6、onalmodi¿cationproce-180instances(200±600customerbenchmarks).duretoeliminateviolationoftheconstraintswhenEAXgen-erateinfeasiblesolutions.Finally,weapplyanevolutionaryI.INTRODUCTIONalgorithm(EA)includingEAXandthemodi¿cationmethodLetanumberofcustomerswithknown

7、demandsandtimetothewell-knownGeringandHombergerbenchmarks[16]windowsbegiven.ThevehicleroutingproblemwithtimefortheVRPTW.windows(VRPTW)consistsof¿ndingaminimum-costrout-Theremainderofthispaperisorganizedasfollows.ingplanofaÀeetofvehicleswhichstartacommondepot

8、,First,theVRPTWisformulatedinsectionII.Andthendeliverloadstoallthecustomers,andreturntothedepot.weproposedEAXdesignedfortheVPPTWinsectionIIITherearetwoconstrains.Thetotaldemandofcustomersandthem

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

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

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