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

Determining Relative Importance and Effective Settings for Genetic Algorithm Control Parameters.

Evolutionary computation - 1 Jan 2015

Mills K L, Filliben J J, Haines A L

Abstract excerpt

Setting the control parameters of a genetic algorithm to obtain good results is a long-standing problem. We define an experiment design and analysis method to determine relative importance and effective settings for control parameters of any evolutionary algorithm, and we apply this method to a classic binary-encoded genetic algorithm (GA). Subsequently, as reported elsewhere, we applied the GA, with the control...

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 Computer Simulation

Methodology Data sources Editorial policy Privacy Delete account & data About Contact Helena Bioinformatics

Share to Computer Systems

Share to Models, Theoretical

Share to Mutation

Share to Population Density

Source

Identifiers

PMID: 25254350
DOI: 10.1162/EVCO_a_00137

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. Graph snapshot: 2026-09-29.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Determining Relative Importance and Effective Settings for Genetic Algorithm Control Parameters.PMID 25254350Read ↗

Borg: an auto-adaptive many-objective evolutionary computing framework.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 ↗

On the effectiveness of crossover in simulated evolutionary optimization.Semantic proximity Read ↗

The hierarchical fair competition (HFC) framework for sustainable evolutionary algorithms.Semantic proximity Read ↗

The role of crossover operator in evolutionary-based approach to the problem of genetic code optimization.Semantic proximity Read ↗

LLM-Driven Metaheuristic Innovation: An Adaptive Hybrid COA–LSHADE–MPA AlgorithmSemantic proximity Read ↗

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

Socio-inspired Evolutionary Algorithms: A Unified Framework and SurveySemantic proximity Read ↗

Genetic algorithms in chemistry.Semantic proximity Read ↗

Fitness distributions in evolutionary computation: motivation and examples in the continuous domain.Semantic proximity Read ↗

Dynamic Optimization with Particle Swarms (DOPS): A meta-heuristic for parameter estimation in biochemical modelsSemantic proximity Read ↗

Conjugate schema and basis representation of crossover and mutation operators.Semantic proximity Read ↗

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