Conclusion
Genetic algorithms, evolutionary algorithms

Add to my library

S7218 V2 Quizzed article

Conclusion
Genetic algorithms, evolutionary algorithms

Author : Évelyne LUTTON

Review date: December 12, 2025 | Lire en français

Add to my library Add to my library

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

6. Conclusion

Following a surge of interest in the 1990s and 2000s, the field of evolutionary algorithms remains highly active.

  • At the theoretical level, substantial work, primarily on the convergence of these algorithms through Markov chain modelling, has established solid foundation for techniques that were initially criticised for their empirical nature. These approaches provide a rich theoretical framework for refining analysis of convergence behaviour and algorithmic efficiency.

  • In terms of applications, evolutionary algorithms are now widely used in both research and industrial contexts.

From an experimental standpoint, they are particularly effective for exploring difficult, irregular, high-dimensional search spaces while limiting the risk of premature convergence. Conversely, given their computational cost, it is inefficient to apply genetic algorithms...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?


Article included in this offer

"Software technologies and System architectures"

( 234 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact us