• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Høgskolen i Molde
  • Bidrag fra ansatte
  • Artikler
  • View Item
  •   Home
  • Høgskolen i Molde
  • Bidrag fra ansatte
  • Artikler
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A cooperative parallel metaheuristic for the capacitated vehicle routing problem

Jin, Jianyong; Crainic, Teodor Gabriel; Løkketangen, Arne
Journal article, Peer reviewed
Accepted version
Thumbnail
View/Open
Article (166.8Kb)
URI
http://hdl.handle.net/11250/2470744
Date
2014
Metadata
Show full item record
Collections
  • Artikler [29]
Abstract
This 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.
Publisher
Elsevier
Copyright
Copyright © 2013 Elsevier Ltd. All rights reserved.

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit