New stopping criterion for genetic algorithms

Article Abstract:

A new bound for genetic algorithms is presented.

Operations Research, Management science, Observations

---

The effect of multiple optima on the simple GA run-time complexity

Article Abstract:

The worst-case analysis of Markov chains, to determine the run-time complexity of genetic algorithms, is presented.

United States, Methods, Stochastic analysis, Genetic algorithms

---

A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets

Article Abstract:

The run-time behavior of genetic algorithms is modeled using higher cardinality representations as Markov chains. The states of the Markov chain are defined and the transition probabilities of the corresponding transition matrix are calculated. An analysis of the behavior of the chain resulted in the derivation of bounds on its convergence rate, and hence, the bounds on the run-time complexity of genetic algorithms. The effects of using binary over higher cardinality representation of a search space are also examined.

Research, Markov processes, Search theory

Similar abstracts:

• Abstracts: A memetic algorithm for the total tardiness single machine scheduling problem. Algorithmic approach to the satisfactory graph partitioning problem
• Abstracts: As Pfizer battles fakes in China, nation's police are uneasy allies. U.K. judge strikes patent blocking Viagra imitators
• Abstracts: As Abbey National nears deal, it faces possible bid by Lloyds. Lloyds steps up pressure on Abbey to accept offer
• Abstracts: Microsoft challenges BlackBerry with new mobile-email devices. H-P shares jump by 12% as brokers improve outlook
• Abstracts: China's new way of doing business; entry into WTO augurs control for foreign companies. DaimlerChrysler steers $226 million into Beijing Jeep Corp

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.