Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem (Q2228400)
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: Variable neighborhood search based algorithms to solve a rich k-travelling repairmen problem |
scientific article; zbMATH DE number 7311817
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem |
scientific article; zbMATH DE number 7311817 |
Statements
Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem (English)
0 references
17 February 2021
0 references
R-\(k\)-TRP
0 references
multiple time windows
0 references
inventory
0 references
GVNS
0 references
adaptive memory
0 references
0 references
0 references
0 references
0.8244611024856567
0 references
0.8010867834091187
0 references
0.794718325138092
0 references
0.7861080765724182
0 references
0.7838197946548462
0 references
