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.

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Andreas Beham
• Keywords: Distributed And Parallel Computing, IPPS 2007, Johannes Kepler University Of Linz, Parallel Implementations, Vehicle Routing Problem