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.
| Original language | English |
|---|---|
| Pages (from-to) | 207-218 |
| Number of pages | 13 |
| Journal | Business Research |
| Volume | 1 |
| Issue number | 2 |
| Publication status | Published - 2008 |
Austrian Fields of Science 2012
- 502050 Business informatics
- 502052 Business administration
- 101015 Operations research