File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Combining meta-heuristics to effectively solve the vehicle routing problems with time windows

TitleCombining meta-heuristics to effectively solve the vehicle routing problems with time windows
Authors
KeywordsGuided local search
Meta-heuristics
Search hybrids
Tabu search
Vehicle routing problems
Issue Date2004
PublisherSpringer Verlag Dordrecht. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0269-2821
Citation
Artificial Intelligence Review, 2004, v. 21 n. 2, p. 87-112 How to Cite?
AbstractThe vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many interesting heuristics proposed to handle these problems effectively. In this paper, we examined two well-known meta-heuristics and carefully combined the short-term and long-term memory-like mechanisms of both methods to achieve better results. Our prototype was shown to compare favorably against the original search methods and other related search hybrids on the Solomon's test cases. More importantly, our proposal of integration opens up many exciting directions for further investigation.
Persistent Identifierhttp://hdl.handle.net/10722/48597
ISSN
2015 Impact Factor: 1.731
2015 SCImago Journal Rankings: 0.948
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorTam, Ven_HK
dc.contributor.authorMa, KTen_HK
dc.date.accessioned2008-05-22T04:18:21Z-
dc.date.available2008-05-22T04:18:21Z-
dc.date.issued2004en_HK
dc.identifier.citationArtificial Intelligence Review, 2004, v. 21 n. 2, p. 87-112en_HK
dc.identifier.issn0269-2821en_HK
dc.identifier.urihttp://hdl.handle.net/10722/48597-
dc.description.abstractThe vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many interesting heuristics proposed to handle these problems effectively. In this paper, we examined two well-known meta-heuristics and carefully combined the short-term and long-term memory-like mechanisms of both methods to achieve better results. Our prototype was shown to compare favorably against the original search methods and other related search hybrids on the Solomon's test cases. More importantly, our proposal of integration opens up many exciting directions for further investigation.en_HK
dc.format.extent162505 bytes-
dc.format.extent936939 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeimage/jpeg-
dc.languageengen_HK
dc.publisherSpringer Verlag Dordrecht. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0269-2821en_HK
dc.relation.ispartofArtificial Intelligence Reviewen_HK
dc.rightsThe original publication is available at www.springerlink.comen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectGuided local searchen_HK
dc.subjectMeta-heuristicsen_HK
dc.subjectSearch hybridsen_HK
dc.subjectTabu searchen_HK
dc.subjectVehicle routing problemsen_HK
dc.titleCombining meta-heuristics to effectively solve the vehicle routing problems with time windowsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0269-2821&volume=21&issue=2&spage=87&epage=112&date=2004&atitle=Combining+meta-heuristics+to+effectively+solve+the+vehicle+routing+problems+with+time+windowsen_HK
dc.identifier.emailTam, V:vtam@eee.hku.hken_HK
dc.identifier.authorityTam, V=rp00173en_HK
dc.description.naturepostprinten_HK
dc.identifier.doi10.1023/B:AIRE.0000020864.28300.eden_HK
dc.identifier.scopuseid_2-s2.0-1942521075en_HK
dc.identifier.hkuros89783-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-1942521075&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume21en_HK
dc.identifier.issue2en_HK
dc.identifier.spage87en_HK
dc.identifier.epage112en_HK
dc.identifier.isiWOS:000220395200001-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridTam, V=7005091988en_HK
dc.identifier.scopusauthoridMa, KT=23009191800en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats