Document Actions
Citation and Metadata
Recommended citation
Polacek M, Benkner S, Doerner KF, Hartl RF (2008). A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows. BuR - Business Research, Vol. 1, Iss. 2, pp. 207-218, URN: urn:nbn:de:0009-20-16535
Download Citation
Endnote
%0 Journal Article %T A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows %A Polacek, Michael %A Benkner, Siegfried %A Doerner, F. Karl %A Hartl, F. Richard %J BuR - Business Research %D 2008 %V 1 %N 2 %@ 1866-8658 %F polacek2008 %X 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 of the best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found. %L 330 %K information systems %K operation %U http://nbn-resolving.de/urn:nbn:de:0009-20-16535 %P 207-218
Bibtex
@Article{polacek2008,
author = "Polacek, Michael
and Benkner, Siegfried
and Doerner, F. Karl
and Hartl, F. Richard",
title = "A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows",
journal = "BuR - Business Research",
year = "2008",
volume = "1",
number = "2",
pages = "207--218",
keywords = "information systems",
keywords = "operation",
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 of the best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found.",
issn = "1866-8658",
url = "http://nbn-resolving.de/urn:nbn:de:0009-20-16535"
}
RIS
TY - JOUR AU - Polacek, Michael AU - Benkner, Siegfried AU - Doerner, F. Karl AU - Hartl, F. Richard PY - 2008// TI - A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows JO - BuR - Business Research SP - 207 EP - 218 VL - 1 IS - 2 KW - information systems KW - operation N2 - 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 of the best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found. SN - 1866-8658 UR - http://nbn-resolving.de/urn:nbn:de:0009-20-16535 ID - polacek2008 ER -
Wordbib
<?xml version="1.0" encoding="UTF-8"?> <b:Sources SelectedStyle="" xmlns:b="http://schemas.openxmlformats.org/officeDocument/2006/bibliography" xmlns="http://schemas.openxmlformats.org/officeDocument/2006/bibliography" > <b:Source> <b:Tag>polacek2008</b:Tag> <b:SourceType>ArticleInAPeriodical</b:SourceType> <b:Year>2008</b:Year> <b:PeriodicalName>BuR - Business Research</b:PeriodicalName> <b:Volume>1</b:Volume> <b:Issue>2</b:Issue> <b:Pages>207-218</b:Pages> <b:Author> <b:Author><b:NameList> <b:Person><b:Last>Polacek</b:Last><b:First>Michael</b:First></b:Person> <b:Person><b:Last>Benkner</b:Last><b:First>Siegfried</b:First></b:Person> <b:Person><b:Last>Doerner</b:Last><b:First>F.</b:First><b:Middle>Karl</b:Middle></b:Person> <b:Person><b:Last>Hartl</b:Last><b:First>F.</b:First><b:Middle>Richard</b:Middle></b:Person> </b:NameList></b:Author> </b:Author> <b:Title>A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows</b:Title> <b:Comments>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 of the best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found.</b:Comments> </b:Source> </b:Sources>
ISI
PT Journal AU Polacek, M Benkner, S Doerner, FK Hartl, FR TI A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows SO BuR - Business Research PY 2008 BP 207 EP 218 VL 1 IS 2 DE information systems; operation AB 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 of the best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found. ER
Mods
<mods>
<titleInfo>
<title>A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows</title>
</titleInfo>
<name type="personal">
<namePart type="family">Polacek</namePart>
<namePart type="given">Michael</namePart>
</name>
<name type="personal">
<namePart type="family">Benkner</namePart>
<namePart type="given">Siegfried</namePart>
</name>
<name type="personal">
<namePart type="family">Doerner</namePart>
<namePart type="given">Karl F.</namePart>
</name>
<name type="personal">
<namePart type="family">Hartl</namePart>
<namePart type="given">Richard F.</namePart>
</name>
<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 of the best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found.</abstract>
<subject>
<topic>information systems</topic>
<topic>operation</topic>
</subject>
<classification authority="ddc">330</classification>
<relatedItem type="host">
<genre authority="marcgt">periodical</genre>
<genre>academic journal</genre>
<titleInfo>
<title>BuR - Business Research</title>
</titleInfo>
<part>
<detail type="volume">
<number>1</number>
</detail>
<detail type="issue">
<number>2</number>
</detail>
<date>2008</date>
<extent unit="page">
<start>207</start>
<end>218</end>
</extent>
</part>
</relatedItem>
<identifier type="issn">1866-8658</identifier>
<identifier type="urn">urn:nbn:de:0009-20-16535</identifier>
<identifier type="uri">http://nbn-resolving.de/urn:nbn:de:0009-20-16535</identifier>
<identifier type="citekey">polacek2008</identifier>
</mods>
Full Metadata
| Bibliographic Citation | BuR - Business Research, Vol. 1, Iss. 2, pp. 207-218 |
|---|---|
| Title | A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows (eng) |
| Author | Michael Polacek, Siegfried Benkner, Karl F. Doerner, Richard F. Hartl |
| Language | eng |
| 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 of the best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found. |
| Subject | information systems, operation |
| DDC | 330 |
| Rights | authorcontract |
| URN: | urn:nbn:de:0009-20-16535 |
