Evolution algorithms in combinatorial optimization (Q1104056)

From MaRDI portal
Revision as of 02:37, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Evolution algorithms in combinatorial optimization
scientific article

    Statements

    Evolution algorithms in combinatorial optimization (English)
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    The paper deals with a presentation of evolution algorithms. The replicator equation is introduced and an application to the graph partitioning problem (GPP) is given. A new generic algorithm for the traveling salesman problem is given. Numerical results are presented. In the last section the network algorithm for the GPP is applied. A number of other questions are also discussed. Reviewer's remark: This algorithm can be easily applied to the symmetric traveling salesman problem.
    0 references
    0 references
    Darwinian algorithm
    0 references
    superlinear speedup
    0 references
    combinatorial optimization
    0 references
    evolution algorithms
    0 references
    replicator equation
    0 references
    graph partitioning problem
    0 references
    generic algorithm
    0 references
    traveling salesman problem
    0 references
    Numerical results
    0 references
    network algorithm
    0 references
    0 references