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 language | English |
---|---|
Title of host publication | Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM |
Publisher | IEEE |
Pages | 1-8 |
Number of pages | 8 |
ISBN (Print) | 1424409101, 9781424409105 |
DOIs | |
Publication status | Published - 2007 |
Event | 21st IEEE International Parallel & Distributed Processing Symposium IPDPS 2007 - Los Angeles, United States Duration: 26 Mar 2007 → 30 Mar 2007 http://www.ipdps.org/ |
Publication series
Name | Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM |
---|
Conference
Conference | 21st IEEE International Parallel & Distributed Processing Symposium IPDPS 2007 |
---|---|
Country/Territory | United States |
City | Los Angeles |
Period | 26.03.2007 → 30.03.2007 |
Internet address |
Keywords
- Multiobjective
- Parallel
- Tabu search
- Vehicle routing