A memetic algorithm for designing balanced incomplete blocks Reportar como inadecuado




A memetic algorithm for designing balanced incomplete blocks - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Carlos Cotta ; Antonio J. Fernández Leiva ;International Journal of Combinatorial Optimization Problems and Informatics 2011, 2 1

Autor: David Rodríguez Rueda

Fuente: http://www.redalyc.org/articulo.oa?id=265219618003


Introducción



International Journal of Combinatorial Optimization Problems and Informatics E-ISSN: 2007-1558 editor@ijcopi.org International Journal of Combinatorial Optimization Problems and Informatics México Rodríguez Rueda, David; Cotta, Carlos; Fernández Leiva, Antonio J. A Memetic Algorithm for Designing Balanced Incomplete Blocks International Journal of Combinatorial Optimization Problems and Informatics, vol.
2, núm.
1, eneroabril, 2011, pp.
14-22 International Journal of Combinatorial Optimization Problems and Informatics Morelos, México Available in: http:--www.redalyc.org-articulo.oa?id=265219618003 How to cite Complete issue More information about this article Journals homepage in redalyc.org Scientific Information System Network of Scientific Journals from Latin America, the Caribbean, Spain and Portugal Non-profit academic project, developed under the open access initiative © International Journal of Combinatorial Optimization Problems and Informatics, Vol.
2, No.
1, JanApril 2011, pp.
14-22.
ISSN: 2007-1558. A Memetic Algorithm for Designing Balanced Incomplete Blocks David Rodríguez Rueda1, Carlos Cotta2, Antonio J.
Fernández Leiva2 1 Universidad Nacional Experimental del Táchira (UNET) Laboratorio de Computación de Alto Rendimiento (LCAR) San Cristóbal, Venezuela drodri@unet.edu.ve 2 Universidad de Málaga ETSI Informática, Campus de Teatinos 29071 Málaga, Spain. {ccottap, afdez}@lcc.uma.es Abstract.
The generation of balanced incomplete block designs (BIBD) is a hard constrained combinatorial problem whose applications are manifold.
Although the BIBD problem can be easily formulated as a combinatorial optimization problem, its resolution still constitutes a formidable challenge for solving techniques.
In this work we devise a memetic algorithm (MA) for tackling the BIBD problem.
This MA features a heuristic recombination operator based on greedy procedures and a local search method embedded in the evolutionary cycle.
An extensive empirical e...





Documentos relacionados