This paper presents a parameter-less optimization framework that uses the extended compact genetic algorithm (EGGA) 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. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Lima, C. F., & Lobo, F. G. (2004). Parameter-less optimization with the extended compact genetic algorithm and iterated local search. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3102, 1328–1339. https://doi.org/10.1007/978-3-540-24854-5_127
Mendeley helps you to discover research relevant for your work.