paper-with-me

홈 › Papers

Benchmarking the Hill-Valley Evolutionary Algorithm for the GECCO 2018 Competition on Niching Methods Multimodal Optimization

2018-06-30 · S. C. Maree, T. Alderliesten, D. Thierens, P. A. N. Bosman

This report presents benchmarking results of the latest version of the Hill-Valley Evolutionary Algorithm (HillVallEA) on the CEC2013 niching benchmark suite. The benchmarking follows restrictions required by the GECCO 2018 competition on Niching methods for Multimodal Optimization. In particular, no problem dependent parameter tuning is performed. A number of adjustments have been made to original publication of HillVallEA that are discussed in this report.

📄 PDF Abstract BibTeX arXiv:1807.00188

Code (1)

scmaree/HillVallEA 공식 구현

Tasks

Benchmarking

Similar Papers 제목 키워드 기반

Benchmarking HillVallEA for the GECCO 2019 Competition on Multimodal Optimization

2019-07-25 · S. C. Maree, T. Alderliesten, P. A. N. Bosman

This report presents benchmarking results of the Hill-Valley Evolutionary Algorithm version 2019 (HillVallEA19) on the CEC2013 niching benchmark suite under the restrictions of the GECCO 2019 niching competition on multi…

Benchmarking

Real-valued Evolutionary Multi-modal Multi-objective Optimization by Hill-Valley Clustering

2020-10-28 · S. C. Maree, T. Alderliesten, P. A. N. Bosman

In model-based evolutionary algorithms (EAs), the underlying search distribution is adapted to the problem at hand, for example based on dependencies between decision variables. Hill-valley clustering is an adaptive nich…

ClusteringEvolutionary Algorithms

Real-Valued Evolutionary Multi-Modal Optimization driven by Hill-Valley Clustering

2018-10-16 · S. C. Maree, T. Alderliesten, D. Thierens, P. A. N. Bosman

Model-based evolutionary algorithms (EAs) adapt an underlying search model to features of the problem at hand, such as the linkage between problem variables. The performance of EAs often deteriorates as multiple modes in…

ClusteringEvolutionary Algorithms

A Tight Runtime Analysis for the cGA on Jump Functions---EDAs Can Cross Fitness Valleys at No Extra Cost

2019-03-26 · Benjamin Doerr

We prove that the compact genetic algorithm (cGA) with hypothetical population size $\mu = \Omega(\sqrt n \log n) \cap \text{poly}(n)$ with high probability finds the optimum of any $n$-dimensional jump function with jum…

Evolutionary Algorithmsvalid

Lens-descriptor guided evolutionary algorithm for optimization of complex optical systems with glass choice

2026-01-29 · Kirill Antonov, Teus Tukker, Tiago Botari, Thomas H. W. Bäck 외 arxiv

Designing high-performance optical lenses entails exploring a high-dimensional, tightly constrained space of surface curvatures, glass choices, element thicknesses, and spacings. In practice, standard optimizers (e.g., g…