Mapping the convergence of genetic algorithms (Q955480): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A greedy genetic algorithm for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the quadratic assignment problem based on convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large quadratic assignment problems on computational grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reactive Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved annealing scheme for the QAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISCON: A New Method for the Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Procedure for the Layout of a Large Number of Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds based on linear programming for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Genetic Algorithm for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compounded genetic algorithms for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extended concentric tabu for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colonies for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A level-2 reformulation-linearization technique bound for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search Applied to the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of iterative searches for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic approach to the quadratic assignment problem / rank
 
Normal rank

Latest revision as of 20:43, 28 June 2024

scientific article
Language Label Description Also known as
English
Mapping the convergence of genetic algorithms
scientific article

    Statements

    Mapping the convergence of genetic algorithms (English)
    0 references
    0 references
    0 references
    20 November 2008
    0 references
    Summary: This paper examines the convergence of genetic algorithms using a cluster-analytic-type procedure. The procedure is illustrated with a hybrid genetic algorithm applied to the quadratic assignment problem. Results provide valuable insight into how population members are selected as the number of generations increases and how genetic algorithms approach stagnation after many generations.
    0 references
    0 references
    0 references
    0 references
    0 references
    convergence
    0 references
    genetic algorithms
    0 references
    quadratic assignment problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references