Show simple item record

dc.contributor.authorJin, Jianyong
dc.contributor.authorCrainic, Teodor Gabriel
dc.contributor.authorLøkketangen, Arne
dc.date.accessioned2017-12-12T12:21:22Z
dc.date.available2017-12-12T12:21:22Z
dc.date.issued2014
dc.identifier.issn0305-0548
dc.identifier.issn1873-765X
dc.identifier.urihttp://hdl.handle.net/11250/2470744
dc.description.abstractThis paper introduces a cooperative parallel metaheuristic for the capacitated vehicle routing problem. The proposed metaheuristic consists of multiple parallel tabu search threads that cooperate by asynchronously exchanging best-found solutions through a common solution pool. The solutions sent to the pool are clustered according to their similarities. The search history information identified from the solution clusters is applied to guide the intensification or diversification of the tabu search threads. Computational experiments on two sets of large-scale benchmark instance sets from the literature demonstrate that the suggested metaheuristic is highly competitive, providing new best solutions to ten of those well-studied instances.nb_NO
dc.language.isoengnb_NO
dc.publisherElseviernb_NO
dc.titleA cooperative parallel metaheuristic for the capacitated vehicle routing problemnb_NO
dc.typeJournal articlenb_NO
dc.typePeer reviewednb_NO
dc.description.versionacceptedVersionnb_NO
dc.rights.holderCopyright © 2013 Elsevier Ltd. All rights reserved.nb_NO
dc.source.pagenumber33-41nb_NO
dc.source.volume44nb_NO


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record