Transform Ranking: a New Method of Fitness Scaling in Genetic Algorithms
The first systematic evaluation of the effects of six existing forms of fitness scaling in genetic algorithms is presented alongside a new method called transform ranking. Each method has been applied to stochastic universal sampling (SUS) over a fixed number of generations. The test functions chosen were the two-dimensional Schwefel and Griewank functions. The quality of the solution was improved by applying sigma scaling, linear rank scaling, nonlinear rank scaling, probabilistic nonlinear rank scaling, and transform ranking. However, this benefit was always at a computational cost. Generic linear scaling and Boltzmann scaling were each of benefit in one fitness landscape but not the other. A new fitness scaling function, transform ranking, progresses from linear to nonlinear rank scaling during the evolution process according to a transform schedule. This new form of fitness scaling was found to be one of the two methods offering the greatest improvements in the quality of search. It provided the best improvement in the quality of search for the Griewank function, and was second only to probabilistic nonlinear rank scaling for the Schwefel function. Tournament selection, by comparison, was always the computationally cheapest option but did not necessarily find the best solutions.
Unable to display preview. Download preview PDF.
- 1.Hopgood, A. A.: Intelligent Systems for Engineers and Scientists, second edition, CRC Press, (2001).Google Scholar
- 4.Schwefel, H.-P.: Numerical optimization of Computer models, John Wiley & Sons (1981).Google Scholar
- 6.Sadjadi, F.: Comparison of fitness scaling functions in genetic algorithms with applications to optical processing. In: Javidi, B. and Psaltis, D. (Eds.), Optical Information Systems II, Proc. SPIE, 5557, pp356–364 (2004).Google Scholar