A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (Q2583172)
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 hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem |
scientific article; zbMATH DE number 2246792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem |
scientific article; zbMATH DE number 2246792 |
Statements
A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (English)
0 references
13 January 2006
0 references
traveling salesman problem
0 references
genetic algorithms
0 references
metaheuristics
0 references
Lagrangean relaxation
0 references
greedy randomized adaptive search procedure
0 references
0.91657066
0 references
0.91079944
0 references
0.9051663
0 references
0.8965695
0 references
0 references
0.8949165
0 references
0.8924146
0 references
0.89207876
0 references
