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

02/19/2004
by   Claudio F. Lima, et al.
0

This paper presents a parameter-less optimization framework that uses the extended compact genetic algorithm (ECGA) and iterated local search (ILS), but is not restricted to these algorithms. The presented optimization algorithm (ILS+ECGA) comes as an extension of the parameter-less genetic algorithm (GA), where the parameters of a selecto-recombinative GA are eliminated. The approach that we propose is tested on several well known problems. In the absence of domain knowledge, it is shown that ILS+ECGA is a robust and easy-to-use optimization method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2021

Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem

We propose a powerful Reinforced Hybrid Genetic Algorithm (RHGA) for the...
research
07/12/2013

Non-Elitist Genetic Algorithm as a Local Search Method

Sufficient conditions are found under which the iterated non-elitist gen...
research
07/05/2019

Genetic Network Architecture Search

We propose a method for learning the neural network architecture that ba...
research
01/24/2020

On the Performance of Metaheuristics: A Different Perspective

Nowadays, we are immersed in tens of newly-proposed evolutionary and swa...
research
05/15/2021

FOGA: Flag Optimization with Genetic Algorithm

Recently, program autotuning has become very popular especially in embed...
research
02/20/2004

An architecture for massive parallelization of the compact genetic algorithm

This paper presents an architecture which is suitable for a massive para...
research
06/12/2020

A supervised learning approach involving active subspaces for an efficient genetic algorithm in high-dimensional optimization problems

In this work, we present an extension of the genetic algorithm (GA) whic...

Please sign up or login with your details

Forgot password? Click here to reset