A general VNS heuristic for the traveling salesman problem with time windows (Q429659)
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 general VNS heuristic for the traveling salesman problem with time windows |
scientific article; zbMATH DE number 6048239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general VNS heuristic for the traveling salesman problem with time windows |
scientific article; zbMATH DE number 6048239 |
Statements
A general VNS heuristic for the traveling salesman problem with time windows (English)
0 references
20 June 2012
0 references
traveling salesman
0 references
time windows
0 references
heuristics
0 references
variable neighborhood search
0 references
variable neighborhood descent
0 references
0 references
0 references
0 references
0.9172981977462769
0 references
0.8793820738792419
0 references
0.8397727608680725
0 references
0.8253011703491211
0 references
0.8233882188796997
0 references
