A new heuristic for vehicle routing with narrow time windows (Q4233387)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1264444
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new heuristic for vehicle routing with narrow time windows |
scientific article; zbMATH DE number 1264444 |
Statements
16 March 1999
0 references
heuristic
0 references
vehicle routing
0 references
narrow time windows
0 references
clustering
0 references
greedy algorithm
0 references
tree partition
0 references
0.8276755213737488
0 references
0.8233333230018616
0 references
0.8228399753570557
0 references
0.8207687139511108
0 references
A new heuristic for vehicle routing with narrow time windows (English)
0 references
