Comparing assignment algorithms for the Multi-Depot VRP
This paper considers the Multi-Depot Vehicle Routing Problem (MDVRP). Given the intrinsic difficulty of this problem class, approximation methods of the type "cluster first, route second" (two step approaches) seem to be promising for practical size problems. The first step, clustering is usually so...
Bewaard in:
| Hoofdauteur: | |
|---|---|
| Andere auteurs: | , |
| Formaat: | report |
| Gepubliceerd in: |
2001
|
| Onderwerpen: | |
| Online toegang: | http://hdl.handle.net/20.500.12008/3478 |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|
Wees de eerste die reageert!