Titel
A cooparative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle. Routing Problem with Time Windows
Autor*in
Siegfried Benkner
... show all
Abstract
In this paper we propose two cooperation schemes to compose new parallel variants of the Variable Neighborhood Search (VNS). On the one hand a coarse grained cooperation scheme is introduced which is well suited for being enhanced with a solution warehouse to store and manage the so far best found solutions and a self-adapting mechanism for the most important search parameters. This makes an a priori parameter tuning obsolete. On the other hand a fine grained scheme was designed to reproduce the successful properties of the sequential VNS. In combination with the use of parallel exploration threads all best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found.
Objekt-Typ
Sprache
Englisch [eng]
Persistent identifier
https://phaidra.univie.ac.at/o:244889
Erschienen in
Titel
Business Research
Band
1
Ausgabe
2
Seitenanfang
207
Seitenende
218
Erscheinungsdatum
01.01.2008
Universität Wien | Universitätsring 1 | 1010 Wien | T +43-1-4277-0