Parameter-less Optimization with the Extended Compact Genetic Algorithm and Iterated Local Search
Claudio F. Lima, Fernando G. Lobo
Abstract
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.
Create a lesson
Related papers
Position Paper: Neurotransmitters as a Missing Dimension in Artificial Neural Networks
Yupei Li, Manuel Milling, Berrak Sisman et al.
A Metaheuristic Optimization Framework for Discrete Optimization under Strict Time Limits
Umut Çalıkyılmaz, Nitin Nayak, Sven Groppe
Benchmarking Tabular Foundation Models as Surrogates in Expensive Evolutionary Optimization
Lu Han, Jin Wang, Yuchen Li et al.
A Spatiotemporal Extension of the Neuromorphic DBSCAN Implementation
Charles P. Rizzo, James S. Plank
Machine Zygote: Causal Biparental Heredity Before Learning in a Germline--Soma Artificial Agent
Lyes Saad Saoud
Bio-Inspired Palette Evolution in Indirectly Encoded Substrates: Timescale Compatibility Shapes Activation Function Discovery
Romain Claret, Michael O'Neill, Paul Cotofrei et al.