Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP) (Q6551139)
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: Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP) |
scientific article; zbMATH DE number 7860795
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP) |
scientific article; zbMATH DE number 7860795 |
Statements
Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP) (English)
0 references
6 June 2024
0 references
shared mobility systems
0 references
pickup and delivery problem (PDP)
0 references
dial-a-ride problem (DARP)
0 references
feasibility checking procedure
0 references
eight-step procedure
0 references
0 references
0 references
0 references
