A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows (Q3770308)
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 4029300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows |
scientific article; zbMATH DE number 4029300 |
Statements
A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows (English)
0 references
1986
0 references
routing
0 references
scheduling
0 references
single-vehicle dial-a-ride problem
0 references
time window constraints
0 references
precedence and capacity constraints
0 references
forward dynamic programming
0 references
0.8409490585327148
0 references
0.837640106678009
0 references
0.8348023891448975
0 references
0.8348021507263184
0 references
0.8202546238899231
0 references
