An efficient GVNS for solving traveling salesman problem with time windows (Q2840756)
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: An efficient GVNS for solving traveling salesman problem with time windows |
scientific article; zbMATH DE number 6190287
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient GVNS for solving traveling salesman problem with time windows |
scientific article; zbMATH DE number 6190287 |
Statements
23 July 2013
0 references
traveling salesman problem
0 references
time window
0 references
GVNS
0 references
0 references
An efficient GVNS for solving traveling salesman problem with time windows (English)
0 references
0.9180894494056702
0 references
0.8793820738792419
0 references
0.7866895198822021
0 references
0.7688509225845337
0 references
0.7647815942764282
0 references
