Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6654146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem |
scientific article; zbMATH DE number 6654146 |
Statements
Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (English)
0 references
17 November 2016
0 references
vehicle routing problem
0 references
large neighborhood search
0 references
split algorithm
0 references
cluster-first route-second heuristic
0 references
0 references
0 references
0.8415347933769226
0 references
0.8189138174057007
0 references
0.8026506900787354
0 references
0.7990949153900146
0 references
0.7990949153900146
0 references
