Inproceedings1348: Unterschied zwischen den Versionen
Aus Aifbportal
K (Added from ontology) |
K (Added from ontology) |
||
| Zeile 2: | Zeile 2: | ||
|ErsterAutorNachname=Branke | |ErsterAutorNachname=Branke | ||
|ErsterAutorVorname=Jürgen | |ErsterAutorVorname=Jürgen | ||
| + | }} | ||
| + | {{Publikation Author | ||
| + | |Rank=3 | ||
| + | |Author=M. Withopf | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=2 | |Rank=2 | ||
|Author=C Schmidt | |Author=C Schmidt | ||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
Version vom 10. September 2009, 23:05 Uhr
A fast look-ahead heuristic for the multi-depot vehicle routing problem
A fast look-ahead heuristic for the multi-depot vehicle routing problem
Published: 2007
Herausgeber: A. Oberweis et al.
Buchtitel: 8. Internationale Tagung Wirtschaftsinformatik
Seiten: 411-428
Verlag: Universitätsverlag Karlsruhe
Referierte Veröffentlichung
BibTeX
Kurzfassung
The multi-depot vehicle routing problem (MDVRP) is a very challenging part of supply chain optimization.
We propose here a simple yet powerful heuristic for the MDVRP with an integrated look-ahead. Compared to other state-of-the-art approaches, our heuristic is significantly faster, but yields competitive results and even found several new best solutions on a set of standard benchmark problems.
ISBN: 9783866440951
VG Wort-Seiten: 36
Forschungsgebiet