|
Title
|
|
|
|
A penalty-bases edge assembly memetic algorithm for the vehicle routing problem with time windows
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| In thispaper,wepresentaneffectivememeticalgorithmforthevehicleroutingproblemwithtime windows (VRPTW).Thepaperbuildsuponanexistingedgeassemblycrossover(EAX)developedforthe capacitated VRP.TheadjustmentsoftheEAXoperatorandtheintroductionofanovelpenaltyfunction to eliminateviolationsofthetimewindowconstraintaswellasthecapacityconstraintfromoffspring solutions generatedbytheEAXoperatorhaveprovenessentialtotheheuristic'sperformance.Experi- mental resultsonSolomon'sandGehringandHombergerbenchmarksdemonstratethatouralgorithm outperforms previousapproachesandisabletoimprove184best-knownsolutionsoutof356instances. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Computers & operations research. - New York, N.Y.
|
|
|
Publication
|
|
|
|
New York, N.Y.
:
2010
|
|
|
ISSN
|
|
|
|
0305-0548
|
|
|
DOI
|
|
|
|
10.1016/J.COR.2009.06.022
|
|
|
Volume/pages
|
|
|
|
37
:4
(2010)
, p. 724-737
|
|
|
ISI
|
|
|
|
000272058100012
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|