Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem (Q2228400): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-020-01551-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3007930322 / rank | |||
Normal rank | |||
Revision as of 00:15, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem |
scientific article |
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
