Title of article
A penalty-basededgeassemblymemeticalgorithmforthevehicleroutingproblem with timewindows
Author/Authors
Yuichi Nagata، نويسنده , , OlliBr¨aysyb، نويسنده , , WoutDullaertc، نويسنده , , d، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
14
From page
724
To page
737
Abstract
In thispaper,wepresentaneffectivememeticalgorithmforthevehicleroutingproblemwithtime
windows (VRPTW).Thepaperbuildsuponanexistingedgeassemblycrossover(EAX)developedforthe
capacitated VRP.TheadjustmentsoftheEAXoperatorandtheintroductionofanovelpenaltyfunction
to eliminateviolationsofthetimewindowconstraintaswellasthecapacityconstraintfromoffspring
solutions generatedbytheEAXoperatorhaveprovenessentialtotheheuristicʹsperformance.Experi-
mental resultsonSolomonʹsandGehringandHombergerbenchmarksdemonstratethatouralgorithm
outperforms previousapproachesandisabletoimprove184best-knownsolutionsoutof356instances.
Keywords
Memetic algorithm , Time Windows , Penalty function , vehicle routing
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927685
Link To Document