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

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

Evolutionary computation - 1 Jan 2016

Hellwig Michael, Arnold Dirk V

Abstract excerpt

This paper investigates constraint-handling techniques used in nonelitist single-parent evolution strategies for the problem of maximizing a linear function with a single linear constraint. Two repair mechanisms are considered, and the analytical results are compared to those of earlier repair approaches in the same fitness environment. The first algorithm variant applies reflection to initially infeasible...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Biological Evolution
Share to Computational Biology

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Computer Simulation

Share to Linear Models

Share to Models, Genetic

Share to Models, Statistical

Share to Selection, Genetic

Source

Identifiers

PMID: 25322066
DOI: 10.1162/EVCO_a_00139

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-08.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

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

Resampling versus repair in evolution strategies applied to a constrained linear problem.Semantic proximity Read ↗

A υ-Constrained Matrix Adaptation Evolution Strategy With Broyden-Based Mutation for Constrained Optimization.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 ↗

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

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

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

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

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

Constrained evolutionary optimization by means of (μ + λ)-differential evolution and improved adaptive trade-off model.Semantic proximity Read ↗

The Dynamics of Cumulative Step Size Adaptation on the Ellipsoid Model.Semantic proximity Read ↗

Optimum tracking with evolution strategies.Semantic proximity Read ↗

Chemical genetic algorithms--evolutionary optimization of binary-to-real-value translation in genetic algorithms.Semantic proximity Read ↗

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