| Article ID: | iaor200971961 |
| Country: | United States |
| Volume: | 2006 |
| Issue: | 70240 |
| Start Page Number: | 1 |
| End Page Number: | 16 |
| Publication Date: | Jan 2006 |
| Journal: | Journal of Applied Mathematics & Decision Sciences |
| Authors: | Dresner Zvi, Marcoulides George A |
| Keywords: | quadratic assignment |
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.