Home |  ENGLISH |  Kontakt |  Impressum |  Anmelden |  KIT

Inproceedings1348

Aus Aifbportal

Wechseln zu: Navigation, Suche

(This page contains COinS metadata)

A fast look-ahead heuristic for the multi-depot vehicle routing problem


Jürgen BrankeChristian Schmidt, Markus Withopf



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

Effiziente Algorithmen


-->