David Rodríguez Rueda

David Rodríguez Rueda
Universidad Nacional Experimental del Táchira, UNET · Departamento de Ingeniería Informática

PhD Computer Sciences

About

7
Publications
1,308
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
21
Citations

Publications

Publications (7)
Article
Full-text available
The template design problem (TDP) is a hard combinatorial problem with a high number of symmetries which makes solving it more complicated. A number of techniques have been proposed in the literature to optimise its resolution, ranging from complete methods to stochastic ones. However, although metaheuristics are considered efficient methods that c...
Article
The Balanced Incomplete Block Design (BIBD) problem is a difficult combinatorial problem with a large number of symmetries, which add complexity to its resolution. In this paper, we propose a dual (integer) problem representation that serves as an alternative to the classical binary formulation of the problem. We attack this problem incrementally:...
Article
Full-text available
p>The problem with designing balanced incomplete blocks (BIBD) is enclosed within the combinatorial optimization approach that has been extensively used in experimental design. The present proposal addresses thi problem by using local search techniques known as Hill Climbing, Tabu Search, and an approach based considerable sized the use of Multi-Ag...
Chapter
Full-text available
This paper deals with the template design problem, a hard constrained combinatorial problem with multiple applications. This problem is here formulated as a two-level combinatorial optimization problem whose solutions are integer matrices. In the higher level, a metaheuris-tic tackles the design of a collection of templates containing multiple inst...
Article
Full-text available
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...
Conference Paper
Full-text available
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulated as a combinatorial optimization problem (COP) whose solutions are binary matrices. Two different neighborhood structures are defined, based on bit-flipping and positio...

Network

Cited By

Projects

Projects (2)
Project
This project revolves around the idea of resilience, both as a sought property in the design and operation of bioinspired optimization methods, and as a property of systems of interest to be attained or boosted via the application of said methods. Herewith, resilience denotes a system's ability to rebound, namely to withstand shocks in a dynamic way and bounce back to good operational conditions in an efficient way.
Project
Use of heuristic, metaheuristic and hybrid techniques, to obtain optimal solutions, applied to problems of combinatorial optimization with a high degree of symmetry.