Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows

Publikation: Beitrag in Buch/Bericht/TagungsbandKonferenzbeitragBegutachtung

2 Zitate (Scopus)

Abstract

In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). Attention in this work was given to keep the parallel implementations simple. The parallel algorithms are of two kinds: Two of them are parallel with respect to functional decomposition and one approach is a collaborative multisearch TS. The implementation builds upon a framework called Distributed metaheuristics or DEME for short. Tests were performed on an SGI Origin 3800 supercomputer at the Johannes Kepler University of Linz, Austria.

OriginalspracheEnglisch
TitelProceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM
Herausgeber (Verlag)IEEE
Seiten1-8
Seitenumfang8
ISBN (Print)1424409101, 9781424409105
DOIs
PublikationsstatusVeröffentlicht - 2007
Veranstaltung21st IEEE International Parallel & Distributed Processing Symposium IPDPS 2007 - Los Angeles, USA/Vereinigte Staaten
Dauer: 26 Mär 200730 Mär 2007
http://www.ipdps.org/

Publikationsreihe

NameProceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Konferenz

Konferenz21st IEEE International Parallel & Distributed Processing Symposium IPDPS 2007
Land/GebietUSA/Vereinigte Staaten
OrtLos Angeles
Zeitraum26.03.200730.03.2007
Internetadresse

Fingerprint

Untersuchen Sie die Forschungsthemen von „Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren