Sciweavers

EUROCAST
2007
Springer

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

14 years 4 months ago
Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft 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 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.
Andreas Beham
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where EUROCAST
Authors Andreas Beham
Comments (0)