Title
A penalty-bases edge assembly memetic algorithm for the vehicle routing problem with time windows A penalty-bases edge assembly memetic algorithm for the vehicle routing problem with time windows
Author
Faculty/Department
Institute for Transport en Maritime Management (ITMMA)
Publication type
article
Publication
New York, N.Y. ,
Subject
Economics
Source (journal)
Computers & operations research. - New York, N.Y.
Volume/pages
37(2010) :4 , p. 724-737
ISSN
0305-0548
ISI
000272058100012
Carrier
E
Target language
English (eng)
Full text (Publishers DOI)
Affiliation
University of Antwerp
Abstract
In thispaper,wepresentaneffectivememeticalgorithmforthevehicleroutingproblemwithtime windows (VRPTW).Thepaperbuildsuponanexistingedgeassemblycrossover(EAX)developedforthe capacitated VRP.TheadjustmentsoftheEAXoperatorandtheintroductionofanovelpenaltyfunction to eliminateviolationsofthetimewindowconstraintaswellasthecapacityconstraintfromoffspring solutions generatedbytheEAXoperatorhaveprovenessentialtotheheuristic'sperformance.Experi- mental resultsonSolomon'sandGehringandHombergerbenchmarksdemonstratethatouralgorithm outperforms previousapproachesandisabletoimprove184best-knownsolutionsoutof356instances.
E-info
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000272058100012&DestLinkType=RelatedRecords&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000272058100012&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000272058100012&DestLinkType=CitingArticles&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
Handle