GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743)
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: GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem |
scientific article; zbMATH DE number 6650554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem |
scientific article; zbMATH DE number 6650554 |
Statements
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (English)
0 references
10 November 2016
0 references
combinatorial optimization
0 references
clustered traveling salesman problem
0 references
heuristics
0 references
path relinking
0 references
GRASP
0 references
0 references
0 references
0 references
0 references
0.8268849849700928
0 references
0.8139235377311707
0 references
0.796359658241272
0 references
0.7843837141990662
0 references
