Using Genetic Algorithms with Real-coded Binary Representation for Solving Non-stationary Problems

  • Jiří Kubalík 
Conference paper


This paper presents genetic algorithms with real-coded binary representation - a novel approach to improve the performance of genetic algorithms. The algorithm is capable of maintaining the diversity of the evolved population during the whole run which protects it from the premature convergence. This is achieved by using a special encoding scheme, introducing a high redundancy, which is further supported by the so-called gene-strength adaptation mechanism for controlling the diversity. The mechanism for the population diversity self-regulation increases the robustness of the algorithm when solving non-stationary problems as was empirically proven on two test cases. The achieved results show the competitiveness of the proposed algorithm with other techniques designed for solving non-stationary problems.


Genetic Algorithm Tracking Error Knapsack Problem Standard Genetic Algorithm Binary Gene 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Fukunaga, A. (1997) Restart scheduling for genetic algorithms. In Thomas Back, editor, Proceedings of ICGA’97, 1997.Google Scholar
  2. [2]
    Morrison, R. W., De Jong, K. A. (2000) Triggered hypermutation revisited. In Proceedings of CEC’2000, pp. 1025–1032Google Scholar
  3. [3]
    Collard, P., Gaspar, A. (1996) Royal-road landscapes for a dual genetic algorithm, in W. Wahlster, editor, ECAI 96: 12th European Conference on Artificial Intelligence, Wiley & Son, pp 214–217Google Scholar
  4. [4]
    Eggermont, J., Lenaerts, T. (2002) Dynamic Optimization using Evolutionary Algorithms with a Case-based Memory, Proceedings of BNAIC’02, K.U.Leuven, Belgium, pages 107–114Google Scholar
  5. [5]
    Lewis, J., Hart, E., Ritchie, G. (1998) A comparison of dominance mechanisms and simple mutation on non-stationary problems. In Eiben, A.E. et al. (Eds.). Proceedings of PPSN’98, LNCS 1498, pp. 139–148, SpringerGoogle Scholar
  6. [6]
    Ng, K. P., Wong, K. C. (1995) A new diploid scheme and dominance change mechanism for non-stationary function optimization. In Proceedings of ICGA’95, pp. 159–166. Morgan KaufmannGoogle Scholar
  7. [7]
    Ošmera, P., Kvasnička, V., Pospíchal, J. (1997) Genetic algorithms with diploid chromosomes. In Proceedings of Mendel’97, pp. 111–116Google Scholar

Copyright information

© Springer-Verlag/Wien 2005

Authors and Affiliations

  • Jiří Kubalík 
    • 1
  1. 1.Department of CyberneticsCTU PragueCzech Republic

Personalised recommendations