Sciweavers

Share
EVOW
2009
Springer

Finding Balanced Incomplete Block Designs with Metaheuristics

10 years 2 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
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 position-swapping. These are used within three metaheuristics, i.e., hill climbing, tabu search, and genetic algorithms. An extensive empirical evaluation is done using 86 different instances of the problem. The results indicate the superiority of the swap-based neighborhood, and the impressive performance of tabu search. This latter approach is capable of outperforming two techniques that had reported the best results in the literature (namely, a neural network with simulated annealing and a constraint local search algorithm).
David Rodríguez Rueda, Carlos Cotta, Antoni
Added 24 Jul 2010
Updated 24 Jul 2010
Type Conference
Year 2009
Where EVOW
Authors David Rodríguez Rueda, Carlos Cotta, Antonio J. Fernández
Comments (0)
books