Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP (Q1691655)
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: Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP |
scientific article; zbMATH DE number 6829427
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP |
scientific article; zbMATH DE number 6829427 |
Statements
Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP (English)
0 references
25 January 2018
0 references
dynamic DARP
0 references
insertion heuristic
0 references
computational experiments
0 references
online heuristic
0 references
0.8795648
0 references
0.8681941
0 references
0 references
0.8597081
0 references
0.8571847
0 references
0.85239375
0 references
