New Ways to Calibrate Evolutionary Algorithms

DOI10.1007/978-3-540-72960-0_8zbMath1211.90303OpenAlexW1484259050MaRDI QIDQ3509424

Gusz Eiben, Martijn C. Schut

Publication date: 1 July 2008

Published in: Natural Computing Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72960-0_8

zbMATH Keywords

genetic algorithmevolutionary computationconstraint satisfaction problempopulation sizemutation rate

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Stochastic optimization method for mechanical design of overhead distribution power lines ⋮ Empirical analysis of a modified Artificial Bee Colony for constrained numerical optimization ⋮ Differential evolution in constrained numerical optimization: an empirical study ⋮ On the Foundations and the Applications of Evolutionary Computing ⋮ A self-guided genetic algorithm for permutation flowshop scheduling problems

Cites Work

• Parameter setting in evolutionary algorithms.
• Evolutionary algorithms. The role of mutation and recombination
• CONTINUOUS EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS
• Introduction to evolutionary computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New Ways to Calibrate Evolutionary Algorithms