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

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

3 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 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.

Original languageEnglish
Title of host publicationProceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM
PublisherIEEE
Pages1-8
Number of pages8
ISBN (Print)1424409101, 9781424409105
DOIs
Publication statusPublished - 2007
Event21st IEEE International Parallel & Distributed Processing Symposium IPDPS 2007 - Los Angeles, United States
Duration: 26 Mar 200730 Mar 2007
http://www.ipdps.org/

Publication series

NameProceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Conference

Conference21st IEEE International Parallel & Distributed Processing Symposium IPDPS 2007
Country/TerritoryUnited States
CityLos Angeles
Period26.03.200730.03.2007
Internet address

Keywords

  • Multiobjective
  • Parallel
  • Tabu search
  • Vehicle routing

Fingerprint

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

Cite this