• norsk
    • English
  • norsk 
    • norsk
    • English
  • Logg inn
Vis innførsel 
  •   Hjem
  • Høgskolen i Molde
  • Bidrag fra ansatte
  • Artikler
  • Vis innførsel
  •   Hjem
  • Høgskolen i Molde
  • Bidrag fra ansatte
  • Artikler
  • Vis innførsel
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
Åpne
Article (166.8Kb)
Permanent lenke
http://hdl.handle.net/11250/2470744
Utgivelsesdato
2014
Metadata
Vis full innførsel
Samlinger
  • Artikler [29]
Sammendrag
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.
Utgiver
Elsevier
Opphavsrett
Copyright © 2013 Elsevier Ltd. All rights reserved.

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit
 

 

Bla i

Hele arkivetDelarkiv og samlingerUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifterDenne samlingenUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifter

Min side

Logg inn

Statistikk

Besøksstatistikk

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit