The time‐consistent dial‐a‐ride problem (Q6065902)
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 7775557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The time‐consistent dial‐a‐ride problem |
scientific article; zbMATH DE number 7775557 |
Statements
The time‐consistent dial‐a‐ride problem (English)
0 references
11 December 2023
0 references
consistency
0 references
dial-a-ride problem
0 references
health care logistics
0 references
large neighborhood search
0 references
set partitioning
0 references
vehicle routing
0 references
0 references
0 references
0 references
0 references
0.7573607563972473
0 references
0.7526636123657227
0 references
0.7449893951416016
0 references
0.734086811542511
0 references
