Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Resampling versus repair in evolution strategies applied to a constrained linear problem.

Evolutionary computation - 1 Jan 2013

Arnold Dirk V

Abstract excerpt

We study the behaviour of multi-recombination evolution strategies for the problem of maximising a linear function with a single linear constraint. Two variants of the algorithm are considered: a strategy that resamples infeasible candidate solutions and one that applies a simple repair mechanism...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Computational Biology
Share to Computer Simulation

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Linear Models

Share to Population Dynamics

Share to Probability

Share to Programming Languages

Share to Reproducibility of Results

Source

Identifiers

PMID: 22780871
DOI: 10.1162/EVCO_a_00088

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 4 Sept 2026. Prepared record publication-22780871-2026-09-04.2. Manifest publication-graph-cohort-2026-09-04.2.

Source receipt: PubMed via Helena Literature Corpus, retrieved 4 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Resampling versus repair in evolution strategies applied to a constrained linear problem.PMID 22780871Read ↗

Comparison of Constraint-Handling Mechanisms for the (1,λ)-ES on a Simple Constrained Problem.Semantic proximity Read ↗

Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem.Semantic proximity Read ↗

An analysis of mutative sigma-self-adaptation on linear fitness functions.Semantic proximity Read ↗

Optimum tracking with evolution strategies.Semantic proximity Read ↗

A study of redundancy and neutrality in evolutionary optimization.Semantic proximity Read ↗

Borg: an auto-adaptive many-objective evolutionary computing framework.Semantic proximity Read ↗

Re-inspiring the genetic algorithm with multi-level selection theory: multi-level selection genetic algorithm.Semantic proximity Read ↗

Locally-adaptive and memetic evolutionary pattern search algorithms.Semantic proximity Read ↗

Step length adaptation on ridge functions.Semantic proximity Read ↗

On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism.Semantic proximity Read ↗

A genetic engineering approach to genetic algorithms.Semantic proximity Read ↗

An Analytical Framework for Runtime of a Class of Continuous Evolutionary Algorithms.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.