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

Andreas Beham

doi:10.1109/IPDPS.2007.370431

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

Andreas Beham

Publikation: Beitrag in Buch/Bericht/Tagungsband › Konferenzbeitrag › Begutachtung

3 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.

Originalsprache	Englisch
Titel	Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM
Herausgeber (Verlag)	IEEE
Seiten	1-8
Seitenumfang	8
ISBN (Print)	1424409101, 9781424409105
DOIs	https://doi.org/10.1109/IPDPS.2007.370431
Publikationsstatus	Veröffentlicht - 2007
Veranstaltung	21st IEEE International Parallel & Distributed Processing Symposium IPDPS 2007 - Los Angeles, USA/Vereinigte Staaten Dauer: 26 März 2007 → 30 März 2007 http://www.ipdps.org/

Publikationsreihe

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

Konferenz

Konferenz	21st IEEE International Parallel & Distributed Processing Symposium IPDPS 2007
Land/Gebiet	USA/Vereinigte Staaten
Ort	Los Angeles
Zeitraum	26.03.2007 → 30.03.2007
Internetadresse	http://www.ipdps.org/

Zugriff auf Dokument

10.1109/IPDPS.2007.370431

Andere Dateien und Links

Link zur Publikation in Scopus

Zitieren

Beham, A. (2007). Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows. in Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM (S. 1-8). Artikel 4228159 (Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM). IEEE. https://doi.org/10.1109/IPDPS.2007.370431

@inproceedings{78b86013bcbb4a8f82d060fcd271299a,

title = "Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows",

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.",

keywords = "Multiobjective, Parallel, Tabu search, Vehicle routing",

author = "Andreas Beham",

year = "2007",

doi = "10.1109/IPDPS.2007.370431",

language = "English",

isbn = "1424409101",

series = "Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM",

publisher = "IEEE",

pages = "1--8",

booktitle = "Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM",

note = "21st IEEE International Parallel & Distributed Processing Symposium IPDPS 2007 ; Conference date: 26-03-2007 Through 30-03-2007",

url = "http://www.ipdps.org/",

}

Beham, A 2007, Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows. in Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM., 4228159, Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM, IEEE, S. 1-8, 21st IEEE International Parallel & Distributed Processing Symposium IPDPS 2007, Los Angeles, USA/Vereinigte Staaten, 26.03.2007. https://doi.org/10.1109/IPDPS.2007.370431

Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows. / Beham, Andreas.
Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM. IEEE, 2007. S. 1-8 4228159 (Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM).

Publikation: Beitrag in Buch/Bericht/Tagungsband › Konferenzbeitrag › Begutachtung

TY - GEN

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

AU - Beham, Andreas

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Multiobjective

KW - Parallel

KW - Tabu search

KW - Vehicle routing

UR - http://www.scopus.com/inward/record.url?scp=34548804324&partnerID=8YFLogxK

U2 - 10.1109/IPDPS.2007.370431

DO - 10.1109/IPDPS.2007.370431

M3 - Conference contribution

SN - 1424409101

SN - 9781424409105

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

SP - 1

EP - 8

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

PB - IEEE

T2 - 21st IEEE International Parallel & Distributed Processing Symposium IPDPS 2007

Y2 - 26 March 2007 through 30 March 2007

ER -

Beham A. Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows. in Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM. IEEE. 2007. S. 1-8. 4228159. (Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM). doi: 10.1109/IPDPS.2007.370431

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

Abstract

Publikationsreihe

Konferenz

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Zitieren