Inproceedings1348: Unterschied zwischen den Versionen
Aus Aifbportal
K (Added from ontology) |
Uri (Diskussion | Beiträge) |
||
| Zeile 5: | Zeile 5: | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=3 | |Rank=3 | ||
| − | |Author= | + | |Author=Markus Withopf |
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=2 | |Rank=2 | ||
| − | |Author= | + | |Author=Christian Schmidt |
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
| Zeile 25: | Zeile 25: | ||
|ISBN=9783866440951 | |ISBN=9783866440951 | ||
|VG Wort-Seiten=36 | |VG Wort-Seiten=36 | ||
| − | + | |Forschungsgruppe=Effiziente Algorithmen | |
| − | |||
| − | |Forschungsgruppe= | ||
}} | }} | ||
Aktuelle Version vom 24. September 2009, 21:42 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
Forschungsgruppe
Forschungsgebiet