Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213)
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: Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem |
scientific article; zbMATH DE number 7340731
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem |
scientific article; zbMATH DE number 7340731 |
Statements
Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (English)
0 references
28 April 2021
0 references
variable neighborhood search
0 references
parallel computing
0 references
vehicle routing problem
0 references
self-adaptive mechanism
0 references
0 references
0 references
0 references
0 references
0.91188794
0 references
0.89464456
0 references
0.87792295
0 references
0.86749566
0 references
