How Well Does the Metropolis Algorithm Cope With Local Optima?-Reference-Cited by-同舟云学术

How Well Does the Metropolis Algorithm Cope With Local Optima?

Published:2023-07-12 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Genetic and Evolutionary Computation Conference
language:
Short-container-title:

Author:

Doerr Benjamin¹^ORCID,El Ghazi El Houssaini Taha¹^ORCID,Rajabi Amirhossein²^ORCID,Witt Carsten²^ORCID

Affiliation:

1. École Polytechnique, Palaiseau, France

2. Technical University of Denmark, Kgs. Lyngby, Denmark

Funder

Danmarks Frie Forskningsfond

Agence Nationale de la Recherche

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3583131.3590390

Reference51 articles.

1. The (1 + ( λ,λ )) GA is even faster on multimodal problems

2. Thomas Bäck . 1996. Evolutionary Algorithms in Theory and Practice - Evolution Strategies , Evolutionary Programming, Genetic Algorithms . Oxford University Press . Thomas Bäck. 1996. Evolutionary Algorithms in Theory and Practice - Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press.

3. Generalized jump functions

4. Chao Bian , Yawen Zhou , Miqing Li , and Chao Qian . 2023 . Stochastic population update can provably be helpful in multi-objective evolutionary algorithms . In International Joint Conference on Artificial Intelligence, IJCAI 2023. To appear. Chao Bian, Yawen Zhou, Miqing Li, and Chao Qian. 2023. Stochastic population update can provably be helpful in multi-objective evolutionary algorithms. In International Joint Conference on Artificial Intelligence, IJCAI 2023. To appear.

5. Duc-Cuong Dang , Anton V. Eremeev , and Per Kristian Lehre . 2021 . Escaping Local Optima with Non-Elitist Evolutionary Algorithms. In AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI Press, 12275--12283. Duc-Cuong Dang, Anton V. Eremeev, and Per Kristian Lehre. 2021. Escaping Local Optima with Non-Elitist Evolutionary Algorithms. In AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI Press, 12275--12283.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. How to Use the Metropolis Algorithm for Multi-Objective Optimization?;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2024-07-14

2. A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive;Proceedings of the Genetic and Evolutionary Computation Conference;2024-07-14

3. Choosing the right algorithm with hints from complexity theory;Information and Computation;2024-01