File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An artificial bee colony algorithm for the capacitated vehicle routing problem

TitleAn artificial bee colony algorithm for the capacitated vehicle routing problem
Authors
KeywordsArtificial bee colony
Metaheuristic
Routing
Issue Date2011
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejor
Citation
European Journal Of Operational Research, 2011, v. 215 n. 1, p. 126-135 How to Cite?
AbstractThis paper introduces an artificial bee colony heuristic for solving the capacitated vehicle routing problem. The artificial bee colony heuristic is a swarm-based heuristic, which mimics the foraging behavior of a honey bee swarm. An enhanced version of the artificial bee colony heuristic is also proposed to improve the solution quality of the original version. The performance of the enhanced heuristic is evaluated on two sets of standard benchmark instances, and compared with the original artificial bee colony heuristic. The computational results show that the enhanced heuristic outperforms the original one, and can produce good solutions when compared with the existing heuristics. These results seem to indicate that the enhanced heuristic is an alternative to solve the capacitated vehicle routing problem. © 2011 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/135063
ISSN
2015 Impact Factor: 2.679
2015 SCImago Journal Rankings: 2.595
ISI Accession Number ID
Funding AgencyGrant Number
Hui Oi Chow Trust200902172003
University Research Committee of the University of Hong Kong201001159008
201011159026
Funding Information:

The research was jointly supported by a Grant (200902172003) from the Hui Oi Chow Trust Fund and two Grants (201001159008 and 201011159026) from the University Research Committee of the University of Hong Kong. This support is gratefully acknowledged. Thanks are also due to the three anonymous referees for their valuable comments.

References

 

DC FieldValueLanguage
dc.contributor.authorSzeto, WYen_HK
dc.contributor.authorWu, Yen_HK
dc.contributor.authorHo, SCen_HK
dc.date.accessioned2011-07-27T01:27:24Z-
dc.date.available2011-07-27T01:27:24Z-
dc.date.issued2011en_HK
dc.identifier.citationEuropean Journal Of Operational Research, 2011, v. 215 n. 1, p. 126-135en_HK
dc.identifier.issn0377-2217en_HK
dc.identifier.urihttp://hdl.handle.net/10722/135063-
dc.description.abstractThis paper introduces an artificial bee colony heuristic for solving the capacitated vehicle routing problem. The artificial bee colony heuristic is a swarm-based heuristic, which mimics the foraging behavior of a honey bee swarm. An enhanced version of the artificial bee colony heuristic is also proposed to improve the solution quality of the original version. The performance of the enhanced heuristic is evaluated on two sets of standard benchmark instances, and compared with the original artificial bee colony heuristic. The computational results show that the enhanced heuristic outperforms the original one, and can produce good solutions when compared with the existing heuristics. These results seem to indicate that the enhanced heuristic is an alternative to solve the capacitated vehicle routing problem. © 2011 Elsevier B.V. All rights reserved.en_HK
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejoren_HK
dc.relation.ispartofEuropean Journal of Operational Researchen_HK
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in European Journal of Operational Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Operational Research, 2011, v. 215 n. 1, p. 126-135. DOI: 10.1016/j.ejor.2011.06.006-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectArtificial bee colonyen_HK
dc.subjectMetaheuristicen_HK
dc.subjectRoutingen_HK
dc.titleAn artificial bee colony algorithm for the capacitated vehicle routing problemen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0377-2217&volume=215&issue=1&spage=126&epage=135 &date=2011&atitle=An+artificial+bee+colony+algorithm+for+the+capacitated+vehicle+routing+problem-
dc.identifier.emailSzeto, WY:ceszeto@hku.hken_HK
dc.identifier.authoritySzeto, WY=rp01377en_HK
dc.description.naturepostprint-
dc.identifier.doi10.1016/j.ejor.2011.06.006en_HK
dc.identifier.scopuseid_2-s2.0-79960903887en_HK
dc.identifier.hkuros188218en_US
dc.identifier.hkuros196758-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79960903887&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume215en_HK
dc.identifier.issue1en_HK
dc.identifier.spage126en_HK
dc.identifier.epage135en_HK
dc.identifier.isiWOS:000294394700014-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridSzeto, WY=7003652508en_HK
dc.identifier.scopusauthoridWu, Y=47161759100en_HK
dc.identifier.scopusauthoridHo, SC=12244049100en_HK
dc.identifier.citeulike9485532-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats