Article

On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm

Authors:

Stefan Droste,

Thomas Jansen,

Ingo WegenerAuthors Info & Claims

PPSN V: Proceedings of the 5th International Conference on Parallel Problem Solving from Nature

Pages 13 - 22

Published: 27 September 1998 Publication History

Abstract

No abstract available.

Cited By

View all

Zhang MArcuri A(2021)Adaptive Hypermutation for Search-Based System Test Generation: A Study on REST APIs with EvoMasterACM Transactions on Software Engineering and Methodology10.1145/346494031:1(1-52)Online publication date: 28-Sep-2021
https://dl.acm.org/doi/10.1145/3464940
Zhang MMarculescu BArcuri AAuger AStützle T(2019)Resource-based test case generation for RESTful web servicesProceedings of the Genetic and Evolutionary Computation Conference10.1145/3321707.3321815(1426-1434)Online publication date: 13-Jul-2019
https://dl.acm.org/doi/10.1145/3321707.3321815
Doerr BJansen TSudholt DWinzen CZarges C(2010)Optimizing monotone functions can be difficultProceedings of the 11th international conference on Parallel problem solving from nature: Part I10.5555/1885031.1885037(42-51)Online publication date: 11-Sep-2010
https://dl.acm.org/doi/10.5555/1885031.1885037
Show More Cited By

On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm
1. Information systems
  1. Data management systems
    1. Database administration
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

The ($$1+\lambda $$1+ý) Evolutionary Algorithm with Self-Adjusting Mutation Rate

We propose a new way to self-adjust the mutation rate in population-based evolutionary algorithms in discrete search spaces. Roughly speaking, it consists of creating half the offspring with a mutation rate that is twice the current mutation rate and ...
The choice of the offspring population size in the (1,λ) evolutionary algorithm

We extend the theory of non-elitist evolutionary algorithms (EAs) by considering the offspring population size in the (1,@l) EA. We establish a sharp threshold at @l=log"e"e"-"1n~5log"1"0n between exponential and polynomial running times on OneMax. For ...
The (1+λ) evolutionary algorithm with self-adjusting mutation rate
GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference

We propose a new way to self-adjust the mutation rate in population-based evolutionary algorithms. Roughly speaking, it consists of creating half the offspring with a mutation rate that is twice the current mutation rate and the other half with half the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PPSN V: Proceedings of the 5th International Conference on Parallel Problem Solving from Nature

September 1998

1036 pages

ISBN:3540650784

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 27 September 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang MArcuri A(2021)Adaptive Hypermutation for Search-Based System Test Generation: A Study on REST APIs with EvoMasterACM Transactions on Software Engineering and Methodology10.1145/346494031:1(1-52)Online publication date: 28-Sep-2021
https://dl.acm.org/doi/10.1145/3464940
Zhang MMarculescu BArcuri AAuger AStützle T(2019)Resource-based test case generation for RESTful web servicesProceedings of the Genetic and Evolutionary Computation Conference10.1145/3321707.3321815(1426-1434)Online publication date: 13-Jul-2019
https://dl.acm.org/doi/10.1145/3321707.3321815
Doerr BJansen TSudholt DWinzen CZarges C(2010)Optimizing monotone functions can be difficultProceedings of the 11th international conference on Parallel problem solving from nature: Part I10.5555/1885031.1885037(42-51)Online publication date: 11-Sep-2010
https://dl.acm.org/doi/10.5555/1885031.1885037
Chen THe JSun GChen GYao X(2009)A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problemsIEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics10.1109/TSMCB.2008.201216739:5(1092-1106)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1109/TSMCB.2008.2012167
Oliveto PHe JYao X(2009)Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problemsIEEE Transactions on Evolutionary Computation10.1109/TEVC.2009.201436213:5(1006-1029)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1109/TEVC.2009.2014362
Doerr BJansen TKlein CRyan C(2008)Comparing global and local mutations on bit stringsProceedings of the 10th annual conference on Genetic and evolutionary computation10.1145/1389095.1389274(929-936)Online publication date: 13-Jul-2008
https://dl.acm.org/doi/10.1145/1389095.1389274
Dietzfelbinger MRowe JWegener IWoelfel PRyan C(2008)Precision, local search and unimodal functionsProceedings of the 10th annual conference on Genetic and evolutionary computation10.1145/1389095.1389249(771-778)Online publication date: 13-Jul-2008
https://dl.acm.org/doi/10.1145/1389095.1389249
Yu YZhou Z(2008)A new approach to estimating the expected first hitting time of evolutionary algorithmsArtificial Intelligence10.1016/j.artint.2008.07.001172:15(1809-1832)Online publication date: 1-Oct-2008
https://dl.acm.org/doi/10.1016/j.artint.2008.07.001
Kumar RBanerjee N(2006)Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problemTheoretical Computer Science10.1016/j.tcs.2006.03.007358:1(104-120)Online publication date: 31-Jul-2006
https://dl.acm.org/doi/10.1016/j.tcs.2006.03.007
Jansen TDe Jong KWegener I(2005)On the Choice of the Offspring Population Size in Evolutionary AlgorithmsEvolutionary Computation10.1162/10636560577466692113:4(413-440)Online publication date: 1-Dec-2005
https://dl.acm.org/doi/10.1162/106365605774666921
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

The ($$1+\lambda $$1+ý) Evolutionary Algorithm with Self-Adjusting Mutation Rate

The choice of the offspring population size in the (1,λ) evolutionary algorithm

The (1+λ) evolutionary algorithm with self-adjusting mutation rate

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations