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

Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

4 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 soft Time Windows (CVRPsTW). The Tabu Search 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
Seiten (von - bis)829-836
Seitenumfang8
FachzeitschriftLecture Notes in Computer Science
Jahrgang4739
Ausgabenummer4739
DOIs
PublikationsstatusVeröffentlicht - Dez 2007

Fingerprint

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

Zitieren