An adaptive large neighborhood search heuristic for the share-a-ride problem (Q342178)
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: An adaptive large neighborhood search heuristic for the share-a-ride problem |
scientific article; zbMATH DE number 6654092
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An adaptive large neighborhood search heuristic for the share-a-ride problem |
scientific article; zbMATH DE number 6654092 |
Statements
An adaptive large neighborhood search heuristic for the share-a-ride problem (English)
0 references
17 November 2016
0 references
transportation
0 references
the share-a-ride problem (SARP)
0 references
adaptive large neighborhood search
0 references
slack time
0 references
0 references
0 references
0 references
0.9300169
0 references
0.91180515
0 references
0.89586675
0 references
0 references
0.8874269
0 references
0 references
0.8725621
0 references
