时间窗约束下的车辆路径问题遗传算法外文翻译可编辑.docx
- 文档编号:911466
- 上传时间:2022-10-13
- 格式:DOCX
- 页数:7
- 大小:93.21KB
时间窗约束下的车辆路径问题遗传算法外文翻译可编辑.docx
《时间窗约束下的车辆路径问题遗传算法外文翻译可编辑.docx》由会员分享,可在线阅读,更多相关《时间窗约束下的车辆路径问题遗传算法外文翻译可编辑.docx(7页珍藏版)》请在冰豆网上搜索。
时间窗约束下的车辆路径问题遗传算法外文翻译可编辑
时间窗约束下的车辆路径问题遗传算法外文翻译
外文翻译
原文
GeneticAlgorithmsfortheVehicleRoutingProblemwithTimeWindows
MaterialSource:
SpecialissueonBioinformaticsandGeneticAlgorithmsAuthor:
OlliBr?
ysy
1Introduction
VehicleRoutingProblemsVRPareallaroundusinthesensethatmanyconsumerproductssuchassoftdrinks,beer,bread,snackfoods,gasolineandpharmaceuticalsaredeliveredtoretailoutletsbyafleetoftruckswhoseoperationfitsthevehicleroutingmodel.Inpractice,theVRPhasbeenrecognizedasoneofthegreatsuccessstoriesofoperationsresearchandithasbeenstudiedwidelysincethelatefifties.Publicservicescanalsotakeadvantageofthesesystemsinordertoimprovetheirlogisticschain.Garbagecollection,ortowncleaning,takesaneverincreasingpartofthebudgetoflocalauthoritiesAtypicalvehicleroutingproblemcanbedescribedastheproblemofdesigningleastcostroutesfromonedepottoasetofgeographicallyscatteredpointscities,stores,warehouses,schools,customersetc.Theroutesmustbedesignedinsuchawaythateachpointisvisitedonlyoncebyexactlyonevehicle,allroutesstartandendatthedepot,andthetotaldemandsofallpointsononeroutemustnotexceedthecapacityofthevehicleTheVehicleRoutingProblemwithTimeWindowsVRPTWisageneralizationoftheVRPinvolvingtheaddedcomplexitythateverycustomershouldbeservedwithinagiventimewindow.AdditionalcomplexitiesencounteredintheVRPTWarelengthofrouteconstraintarisingfromdepottimewindowsandcostofwaitingtime,whichisincurredwhenavehiclearrivestooearlyatacustomerlocation.Specificexamplesofproblemswithtimewindowsincludebankdeliveries,postaldeliveries,industrialrefusecollection,school-busroutingandsituationswherethecustomermustprovideaccess,verification,orpaymentupondeliveryoftheproductorservice[SolomonandDesrosiers,1988].
Besidesbeingoneofthemostimportantproblemsofoperationsresearchinpracticalterms,thevehicleroutingproblemisalsooneofthemostdifficultproblemstosolve.Itisquiteclosetooneofthemostfamouscombinatorialoptimizationproblems,theTravelingSalespersonProblemTSP,whereonlyonepersonhastovisitallthecustomers.TheTSPisanNP-hardproblem.Itisbelievedthatonemayneverfindacomputationaltechniquethatwillguaranteeoptimalsolutionstolargerinstancesforsuchproblems.Thevehicleroutingproblemisevenmorecomplicated.Evenforsmallfleetsizesandamoderatenumberoftransportationrequests,theplanningtaskishighlycomplex.Hence,itisnotsurprisingthathumanplannerssoongetoverwhelmed,andmustturntosimple,localrulesforvehiclerouting.Nextwewilldescribebasicprinciplesofgeneticalgorithmsandsomeapplicationsforvehicleroutingproblemwithtimewindows.
2Generalprinciplesofgeneticalgorithms
TheGeneticAlgorithmGAisanadaptiveheuristicsearchmethodbasedonpopulationgenetics.Thebasicconceptsaredevelopedby[Holland,1975],whilethepracticalityofusingtheGAtosolvecomplexproblemsisdemonstratedin[DeJong,1975]and[Goldberg,1989].Referencesanddetailsaboutgeneticalgorithmscanalsobefoundforexamplein[Alander,2000]and[Mühlenbein,1997]respectively.Thecreationofanewgenerationofindividualsinvolvesprimarilyfourmajorstepsorphases:
representation,selection,recombinationandmutation.Therepresentationofthesolutionspaceconsistsofencodingsignificantfeaturesofasolutionasachromosome,defininganindividualmemberofapopulation.Typicallypicturedbyabitstring,achromosomeismadeupofasequenceofgenes,whichcapturethebasiccharacteristicsofasolution.
Therecombinationorreproductionprocessmakesuseofgenesofselectedparentstoproduceoffspringthatwillformthenextgeneration.Itcombinescharacteristicsofchromosomestopotentiallycreateoffspringwithbetterfitness.Asformutation,itconsistsofrandomlymodifyinggenesofasingleindividualatatimetofurtherexplorethesolutionspaceandensure,orpreserve,geneticdiversity.Theoccurrenceofmutationisgenerallyassociatedwithlowprobability.Anewgenerationiscreatedbyrepeatingtheselection,reproductionandmutationprocessesuntilallchromosomesinthenewpopulationreplacethosefromtheoldone.Aproperbalancebetweengeneticqualityanddiversityisthereforerequiredwithinthepopulationinordertosupportefficientsearch.
AlthoughtheoreticalresultsthatcharacterizethebehavioroftheGAhavebeenobtainedforbit-stringchromosomes,notallproblemslendthemselveseasilytothisrepresentation.Thisisthecase,inparticular,forsequencingproblems,likevehicleroutingproblem,whereanintegerrepresentationismoreoftenappropriate.Weareawareofonlyoneapproachby[Thangiah,
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 时间 约束 车辆 路径 问题 遗传 算法 外文 翻译 编辑