A way to optimally solve a time-dependent vehicle routing problem with time windows (Q1002083)
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 5509876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A way to optimally solve a time-dependent vehicle routing problem with time windows |
scientific article; zbMATH DE number 5509876 |
Statements
A way to optimally solve a time-dependent vehicle routing problem with time windows (English)
0 references
23 February 2009
0 references
vehicle routing
0 references
time window
0 references
time-dependent costs
0 references
0 references
0.8561525940895081
0 references
0.8447585701942444
0 references
0.8432952761650085
0 references
0.8404360413551331
0 references
