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

Research output: Contribution to journalArticlepeer-review

4 Citations (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.
Original languageEnglish
Pages (from-to)829-836
Number of pages8
JournalLecture Notes in Computer Science
Volume4739
Issue number4739
DOIs
Publication statusPublished - Dec 2007

Fingerprint

Dive into the research topics of 'Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows'. Together they form a unique fingerprint.

Cite this