A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326)
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 variable iterated greedy algorithm for the traveling salesman problem with time windows |
scientific article; zbMATH DE number 6679231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A variable iterated greedy algorithm for the traveling salesman problem with time windows |
scientific article; zbMATH DE number 6679231 |
Statements
A variable iterated greedy algorithm for the traveling salesman problem with time windows (English)
0 references
31 January 2017
0 references
traveling salesman problem with time windows
0 references
iterated greedy algorithm
0 references
variable neighborhood search
0 references
heuristic optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8527609705924988
0 references
0.8253011703491211
0 references
0.8214018940925598
0 references
0.801604688167572
0 references
0.793087363243103
0 references
