An Experimental Study of Operator Choices in the $$(1+(\lambda ,\lambda ))$$ Genetic Algorithm

DOI10.1007/978-3-030-58657-7_26zbMath1460.90209OpenAlexW3086488123MaRDI QIDQ4965122

Anton Bassin, Maxim Buzdalov

Publication date: 25 February 2021

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-58657-7_26

zbMATH Keywords

algorithm configurationparameter tuning\((1+(\lambda,\lambda))\) genetic algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Runtime analysis for permutation-based evolutionary algorithms ⋮ Using Automated Algorithm Configuration for Parameter Control

Uses Software

• irace

Cites Work

• From black-box complexity to designing new genetic algorithms
• Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
• Critical Behavior in the Satisfiability of Random Boolean Expressions
• Faster black-box algorithms through higher arity operators

This page was built for publication: An Experimental Study of Operator Choices in the $$(1+(\lambda ,\lambda ))$$ Genetic Algorithm