A Sensitivity Analysis of Critical Genetic Algorithm Parameters: Highway Alignment Optimization Case Study

摘要

Genetic Algorithms (GAs) have been applied in many complex combinatorial optimization problems and have been proven to yield reasonably good solutions due to their ability of searching in continuous spaces and avoiding local optima. However, one issue in GA application that needs to be carefully explored is to examine sensitivity of critical parameters that may affect the quality of solutions. The key critical GA parameters affecting solution quality include the number of genetic operators, the number of encoded decision variables, the parameter for selective pressure, and the parameter for non-uniform mutation. The effect of these parameters on solution quality is particularly significant for complex problems of combinatorial nature. In this paper the authors test the sensitivity of critical GA parameters in optimizing 3-dimensional highway alignments which has been proven to be a complex combinatorial optimization problem for which an exact solution is not possible warranting the application of heuristics procedures, such as GAs. If GAs are applied properly, similar optimal solutions should be expected at each replication. The authors perform several example studies in order to arrive at a general set of conclusions regarding the sensitivity of critical GA parameters on solution quality. The first study shows that the optimal solutions obtained for a range of scenarios consisting of different combinations of the critical parameters are quite close. The second study shows that different optimal solutions are obtained when the number of encoded decision variables is changed.