DeepAI AI Chat
Log In Sign Up

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

by   Claudio F. Lima, et al.
University of Algarve

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.


page 1

page 2

page 3

page 4


Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem

We propose a powerful Reinforced Hybrid Genetic Algorithm (RHGA) for the...

Non-Elitist Genetic Algorithm as a Local Search Method

Sufficient conditions are found under which the iterated non-elitist gen...

Genetic Network Architecture Search

We propose a method for learning the neural network architecture that ba...

On the Performance of Metaheuristics: A Different Perspective

Nowadays, we are immersed in tens of newly-proposed evolutionary and swa...

FOGA: Flag Optimization with Genetic Algorithm

Recently, program autotuning has become very popular especially in embed...

An architecture for massive parallelization of the compact genetic algorithm

This paper presents an architecture which is suitable for a massive para...