Welcome
TwitterFacebookGoogle

VINÍCIUS VELOSO DE MELO

Improving Global Numerical Optimization using a Search-space Reduction Algorithm

Posted on by Posted in Conference, Efficiency enhancement, Evolutionary algorithm, Global Continuous Unconstrained Optimization, Metaheuristic, Optimization, Promising region

We have developed an algorithm for reduction of search-space, called Domain Optimization Algorithm (DOA), applied to global optimization. This approach can efficiently eliminate search-space regions with low probability of containing a global optimum. DOA basically works using simple models for search-space regions to identify and eliminate non-promising regions. The proposed approach has shown relevant results for tests using hard benchmark functions.

+-Bibtex citation

@inproceedings{deMelo:2007:IGN:1276958.1277191,
author = {de Melo, Vinicius Veloso and Delbem, Alexandre Claudio Botazzo and Pinto,Junior, Dorival Leao and Federson, Fernando Marques},
title = {Improving global numerical optimization using a search-space reduction algorithm},
booktitle = {Proceedings of the 9th annual conference on Genetic and evolutionary computation},
series = {GECCO ’07},
year = {2007},
isbn = {978-1-59593-697-4},
location = {London, England},
pages = {1195–1202},
numpages = {8},
url = {http://doi.acm.org/10.1145/1276958.1277191},
doi = {10.1145/1276958.1277191},
acmid = {1277191},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {genetic algorithms, heuristics, metaheuristics, optimization},
}
+-Online article/Download link

http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p1195.pdf