Solving the dynamic Dial-a-Ride problem using a rolling-horizon event-based graph (Q6587283)
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: Solving the dynamic Dial-a-Ride problem using a rolling-horizon event-based graph |
scientific article; zbMATH DE number 7896700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the dynamic Dial-a-Ride problem using a rolling-horizon event-based graph |
scientific article; zbMATH DE number 7896700 |
Statements
Solving the dynamic Dial-a-Ride problem using a rolling-horizon event-based graph (English)
0 references
13 August 2024
0 references
dial-a-ride problem
0 references
ridepooling
0 references
event-based MILP
0 references
rolling-horizon
0 references
dynamic requests
0 references
0.8149486780166626
0 references
0.7750446796417236
0 references
0.7661094069480896
0 references
0.7639897465705872
0 references
0.7622249722480774
0 references
