A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (Q2583172)

From MaRDI portal
Revision as of 00:55, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    0 references
    0 references
    13 January 2006
    0 references
    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 references