Detail publikace

Optimizing GA Lifetime Parameters analyzing Error Probability Estimates

Originální název

Optimizing GA Lifetime Parameters analyzing Error Probability Estimates

Anglický název

Optimizing GA Lifetime Parameters analyzing Error Probability Estimates

Jazyk

en

Originální abstrakt

The purpose of the paper is to discuss the qualitative properties of a certain class of genetic algorithms from the reliability viewpoint. The reliability of the algorithm is understood as the seldom occurance of big computational errors. This concept is measured either by a simple error probability estimate for a given error level or by a error level estimate for a given probability. Then the suitable value of the lifetime parameter is chosen minimizing above-mentioned measures. A short remark is addressed to the stability of such choice. General ideas are tested for a specific GA class with an advanced crossover operator. It also includes a lifetime limit of population element. All computations are realized for an example of staircase function identification.

Anglický abstrakt

The purpose of the paper is to discuss the qualitative properties of a certain class of genetic algorithms from the reliability viewpoint. The reliability of the algorithm is understood as the seldom occurance of big computational errors. This concept is measured either by a simple error probability estimate for a given error level or by a error level estimate for a given probability. Then the suitable value of the lifetime parameter is chosen minimizing above-mentioned measures. A short remark is addressed to the stability of such choice. General ideas are tested for a specific GA class with an advanced crossover operator. It also includes a lifetime limit of population element. All computations are realized for an example of staircase function identification.

BibTex


@inproceedings{BUT2218,
  author="Jan {Roupec} and Pavel {Popela} and Pavel {Ošmera}",
  title="Optimizing GA Lifetime Parameters analyzing Error Probability Estimates",
  annote="The purpose of the paper is to discuss the qualitative properties of a certain class of genetic algorithms from the reliability viewpoint. The reliability of the algorithm is understood as the seldom occurance of big computational errors. This concept is measured either by a simple error probability estimate for a given error level or by a error level estimate for a given probability. Then the suitable value of the lifetime parameter is chosen minimizing above-mentioned measures. A short remark is addressed to the stability of such choice. General ideas are tested for a specific GA class with an advanced crossover operator. It also includes a lifetime limit of population element. All computations are realized for an example of staircase function identification.",
  address="PC-DIR",
  booktitle="The 6th International Conference on Soft Computing MENDEL 2000",
  chapter="2218",
  institution="PC-DIR",
  year="2001",
  month="june",
  pages="139",
  publisher="PC-DIR",
  type="conference paper"
}