Parallel tabu search and the multiobjective capacitated vehicle routing problem with soft time windows

Authors:
Andreas Beham
Affiliations:
Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria
Venue:
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Year:
2007

Citing 6
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints

Computers and Operations Research
Parallel Metaheuristics: A New Class of Algorithms

Parallel Metaheuristics: A New Class of Algorithms
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

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.