Mapping the convergence of genetic algorithms

摘要

This paper examines the convergence of genetic algorithms using acluster-analytic-type procedure. The procedure is illustrated witha hybrid genetic algorithm applied to the quadratic assignmentproblem. Results provide valuable insight into how populationmembers are selected as the number of generations increases and howgenetic algorithms approach stagnation after many generations.