TY - JOUR
T1 - Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows
AU - Beham, Andreas
PY - 2007/12
Y1 - 2007/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38449085134&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-75867-9_104
DO - 10.1007/978-3-540-75867-9_104
M3 - Article
SN - 0302-9743
VL - 4739
SP - 829
EP - 836
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
IS - 4739
ER -