Parameter Less Local Optimizer with Linkage Identification for Deterministic Order k Decomposable Problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00184061" target="_blank" >RIV/68407700:21230/11:00184061 - isvavai.cz</a>
Result on the web
<a href="http://dl.acm.org/citation.cfm?id=2001656" target="_blank" >http://dl.acm.org/citation.cfm?id=2001656</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/2001576.2001656" target="_blank" >10.1145/2001576.2001656</a>
Alternative languages
Result language
angličtina
Original language name
Parameter Less Local Optimizer with Linkage Identification for Deterministic Order k Decomposable Problems
Original language description
A simple parameter-less local optimizer able to solve deterministic problems with building blocks of bounded order is proposed in this article. The algorithm is able to learn and use linkage information during the run. The algorithm is algorithmically simple, easy to implement and with the exception of termination condition, it is completely parameter-free - there is thus no need to tune the population size and other parameters to the problem at hand. An empirical comparison on 3 decomposable functions,each with uniformly scaled building blocks of size 5 and 8, was carried out. The algorithm exhibits quadratic scaling with the problem dimensionality, but the comparison with the extended compact genetic algorithm and Bayesian optimization algorithm shows that it needs lower or comparable number of fitness function evaluations on the majority of functions for the tested problem dimensionalities.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation
ISBN
978-1-4503-0557-0
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
577-584
Publisher name
ACM
Place of publication
New York
Event location
Dublin
Event date
Jul 12, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—