Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/76226
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Industrial and Systems Engineering-
dc.creatorNg, KKH-
dc.creatorLee, CKM-
dc.creatorZhang, SZ-
dc.creatorWu, K-
dc.creatorHo, W-
dc.date.accessioned2018-05-10T02:55:35Z-
dc.date.available2018-05-10T02:55:35Z-
dc.identifier.issn0360-8352-
dc.identifier.urihttp://hdl.handle.net/10397/76226-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.rights© 2017 Elsevier Ltd. All rights reserved.en_US
dc.rights© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/.en_US
dc.subjectOnline vehicle routing problemen_US
dc.subjectSwarm intelligenceen_US
dc.subjectArtificial bee colony algorithmen_US
dc.subjectMultiple colony strategyen_US
dc.titleA multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestionen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage151-
dc.identifier.epage168-
dc.identifier.volume109-
dc.identifier.doi10.1016/j.cie.2017.05.004-
dcterms.abstractAn Online Vehicle Routing Problem is a formation of Capacitated Vehicle Routing Problem with rerouting strategy to resolve the problem of inefficient vehicle routing caused by traffic congestion. A flexible delivery rerouting strategy is proposed, which aims at reducing the risk of late delivery. The method of terminating an exploration in a solution by the original ABC algorithm, when the solution is trapped in local optima, is to abandon the solution after specific tolerance limits are set. The phenomenon of local optimal traps will be repeated rapidly after a lengthy recursive process and will eventually result in a low quality solution, with a more complex combinatorial problem when the capability of the exploration is restricted by an inflexible termination criterion. Therefore, this paper proposes a novel scheme using a Multiple Colonies Artificial Bee Colony algorithm. The designs of the outstanding bee selection for colony communication show it to be superior in exploitation. The performance of the proposed algorithm is examined through by Capacitated Vehicle Routing instances and a case study, and the results indicate the potential of using real time information for data-driven vehicle scheduling.-
dcterms.accessRightsopen access-
dcterms.bibliographicCitationComputers and industrial engineering, July 2017, v. 109, p. 151-168-
dcterms.isPartOfComputers and industrial engineering-
dcterms.issued2017-07-
dc.identifier.isiWOS:000405052300013-
dc.identifier.eissn1879-0550-
dc.identifier.rosgroupid2017001328-
dc.description.ros2017-2018 > Academic research: refereed > Publication in refereed journal-
dc.description.validate201805 bcrc-
dc.description.oaAccepted Manuscript-
dc.identifier.FolderNumbera0772-n01-
dc.identifier.SubFormID1561-
dc.description.fundingSourceSelf-funded-
dc.description.pubStatusPublished-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
1561_AMULTI_1.PDFPre-Published version2.14 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

105
Last Week
0
Last month
Citations as of Jul 3, 2022

Downloads

42
Citations as of Jul 3, 2022

SCOPUSTM   
Citations

86
Last Week
2
Last month
Citations as of Jun 30, 2022

WEB OF SCIENCETM
Citations

69
Last Week
0
Last month
Citations as of Jun 30, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.