A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (Q2583172): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-005-4921-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006965378 / rank | |||
Normal rank | |||
Revision as of 23:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem |
scientific article |
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
