A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616)
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: A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem |
scientific article; zbMATH DE number 7485233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem |
scientific article; zbMATH DE number 7485233 |
Statements
A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (English)
0 references
7 March 2022
0 references
routing
0 references
dial-a-ride
0 references
matheuristics
0 references
iterated local search
0 references
0 references
0 references
0 references
0 references
0 references
0.8742290139198303
0 references
0.8439412713050842
0 references
0.8342506289482117
0 references
0.8191993236541748
0 references
0.8183548450469971
0 references
