AI Chat AI Image Generator AI Video Text to Speech

Non-Elitist Genetic Algorithm as a Local Search Method

07/12/2013

∙

by Anton Eremeev, et al.

∙

∙

Sufficient conditions are found under which the iterated non-elitist genetic algorithm with tournament selection first visits a local optimum in polynomially bounded time on average. It is shown that these conditions are satisfied on a class of problems with guaranteed local optima (GLO) if appropriate parameters of the algorithm are chosen.

page 1

page 2

page 3

page 4

research

∙ 02/19/2004

Parameter-less Optimization with the Extended Compact Genetic Algorithm and Iterated Local Search

This paper presents a parameter-less optimization framework that uses th...

0 Claudio F. Lima, et al. ∙

research

∙ 03/16/2020

Inverse design of multilayer nanoparticles using artificial neural networks and genetic algorithm

The light scattering of multilayer nanoparticles can be solved by Maxwel...

0 Cankun Qiu, et al. ∙

research

∙ 10/18/2020

DAGs with No Fears: A Closer Look at Continuous Optimization for Learning Bayesian Networks

This paper re-examines a continuous optimization framework dubbed NOTEAR...

0 Dennis Wei, et al. ∙

research

∙ 03/19/2010

Nurse Rostering with Genetic Algorithms

In recent years genetic algorithms have emerged as a useful tool for the...

0 Uwe Aickelin, et al. ∙

research

∙ 07/26/2021

A Partial Reproduction of A Guided Genetic Algorithm for Automated Crash Reproduction

This paper is a partial reproduction of work by Soltani et al. which pre...

0 Philip Oliver, et al. ∙

research

∙ 12/07/2015

Level-Based Analysis of Genetic Algorithms for Combinatorial Optimization

The paper is devoted to upper bounds on run-time of Non-Elitist Genetic ...

0 Duc-Cuong Dang, et al. ∙

research

∙ 02/02/2021

Clustering with Penalty for Joint Occurrence of Objects: Computational Aspects

The method of Holý, Sokol and Černý (Applied Soft Computing, 2017, Vol. ...

0 Ondřej Sokol, et al. ∙