Complexity of scheduling for DARP with soft ride times (Q2294048)
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: Complexity of scheduling for DARP with soft ride times |
scientific article; zbMATH DE number 7163783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of scheduling for DARP with soft ride times |
scientific article; zbMATH DE number 7163783 |
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
0.943123698234558
0 references
0.7953314781188965
0 references
0.7683830857276917
0 references
0.761728823184967
0 references
0.7606801390647888
0 references
