Complexity of scheduling for DARP with soft ride times (Q2294048)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of scheduling for DARP with soft ride times |
scientific article |
Statements
Complexity of scheduling for DARP with soft ride times (English)
0 references
6 February 2020
0 references
dial-a-ride
0 references
scheduling
0 references
Vehicle Routing Problem
0 references
NP-hardness
0 references
ride times
0 references
time windows
0 references