Performance of Genetic Algorithms: An Examination of the Impact of Encoding, Crossover, and Mutation Operators
We explore the use of GAs for solving a network optimization problem, the degree-constrained minimum spanning tree problem. We also examine the impact of encoding, crossover, and mutation on the performance of the GA. A specialized repair heuristic is used to improve performance. An experimental design with 48 cells and ten data points in each cell is used to examine the impact of two encoding methods, three crossover methods, two mutation methods, and four networks of varying node sizes. Two performance measures, solution quality and computation time, are used to evaluate the performance. The results obtained indicate that encoding has the greatest effect on solution quality, followed by mutation and crossover. Among the various options, the combination of determinant encoding, exchange mutation, and uniform crossover more often provides better results for solution quality than other combinations. For computation time, the combination of determinant encoding, exchange mutation, and one-point crossover provides better results.
encoding, genetic algorithms, telecommunication network planning, trees (mathematics)
Computer Sciences | Theory and Algorithms
Information Systems and Management
IEEE Transactions on Evolutionary Computation
CHOU, Hsinghua; Premkumar, G.; and CHU, Chao-Hsien.
Performance of Genetic Algorithms: An Examination of the Impact of Encoding, Crossover, and Mutation Operators. (2001). IEEE Transactions on Evolutionary Computation. 5, (3), 236-249. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1765