New measures of proximity for the assignment algorithms in the MDVRPTW (Q5469660)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New measures of proximity for the assignment algorithms in the MDVRPTW |
scientific article; zbMATH DE number 5026980
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New measures of proximity for the assignment algorithms in the MDVRPTW |
scientific article; zbMATH DE number 5026980 |
Statements
New measures of proximity for the assignment algorithms in the MDVRPTW (English)
0 references
26 May 2006
0 references
multi-depot vehicle routing problem
0 references
clustering
0 references
assignment
0 references
time windows
0 references
0.84126186
0 references
0.8401005
0 references
0 references
0.8344294
0 references
0.8340202
0 references
0.8336928
0 references
0.83239806
0 references
0.83239806
0 references
