A Multi-Agent Proposal for the Resolution of BIBD Instances

• DAVID RODRÍGUEZ ^[1] ; ENRIQUE DARGHAN ^[2] ; JULIO MONROY ^[3]
  1. [1] Universidad Nacional Experimental del Táchira

     Universidad Nacional Experimental del Táchira

     Venezuela

     
  2. [2] Universidad Nacional de Colombia

     Universidad Nacional de Colombia

     Colombia

     
  3. [3] Universidad de Pamplona

     Universidad de Pamplona

     Colombia

     

  Mostrar afiliaciones +
• Localización: Revista Colombiana de Estadística, ISSN-e 2389-8976, ISSN 0120-1751, Vol. 39, Nº. 2, 2016, págs. 267-280
• Idioma: inglés
• DOI: 10.15446/rce.v39n2.52838
• Títulos paralelos:
  • Una propuesta multi-agente en la resolución de instancias del BIBD
• Enlaces
  • Texto completo
• Resumen
  • español

    El problema del diseño de bloques incompletos equilibrados (BIBD) se enmarca dentro del enfoque de optimización combinatoria que ha sido utilizado ampliamente en el diseño de experimentos. La presente propuesta aborda este problema utilizando técnicas de búsqueda local conocidas como Ascenso a la Colina (Hill Climbing), Búsqueda Tabú (Tabu Search) y un enfoque basado en el uso de Multi-Agentes que permiten la exploración de diversas áreas de espacios de búsqueda de tamaño considerable, además se presenta el uso de una visión vectorial para la consideración asociada a la vecindad. Los resultados experimentales evidencian la ventaja de esta técnica frente a otras propuestas mostradas en la literatura actual.

  • English

    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 this problem by using local search techniques known as Hill Climbing, Tabu Search, and an approach based considerable sized the use of Multi-Agents, which allows the exploration of diverse areas of search spaces. Furthermore, the use of a vector vision for the consideration associated with vicinity is presented. The experimental results prove the advantage of this technique compared to other proposals that are reported in the current literature.

• Referencias bibliográficas
  • Anderson, I.. (1997). Combinatorial designs and tournaments. Clarendon Press, Oxford University Press.
  • Bofill, P.,Guimerà, R.,Torras, C.. (2003). 'Comparison of simulated annealing and mean field annealing as applied to the generation of...
  • Buratti, M.. (1999). 'Some (17q, 17, 2) and (25q, 25, 3)BIBD constructions'. Designs, Codes and Cryptography. 16. 117-120
  • Colbourn, C.,Dinitz, J.. (1996). The CRC handbook of combinatorial designs. CRC Press.
  • Corneil, D. G.,Mathon, R.. (1978). 'Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial...
  • Daisuke Yokoya, T. Y.. (2009). 'A mathematical programming approach to the construction of bibds'. International Journal of Computer...
  • Fisher, R. A.. (1926). 'The arrangement of field experiments'. Journal of the Ministry of Agriculture Great Britain. 33.
  • Fisher, R. A.. (1940). 'An examination of the different possible solutions of a problem in incomplete blocks'. Annals of Eugenics....
  • Flener, P.,Frisch, A. M.,Hnich, B.,Kzltan, Z.,Miguel, I.,Walsh, T.. (2001). Matrix modelling. 'CP-01 Workshop on Modelling and Problem...
  • Gibbons, P. B.,Ostergard, P. R. J.. (2007). 'Handbook of Combinatorial Designs'. Chapman & Hall/CRC Press.
  • Hall, M. J.. (1998). Combinatorial Theory. 2. John Wiley & Sons, Inc.. New York.
  • Hinkelman, K.,Kempthorne, O.. (1994). Design and analysis of experiments. John Wiley and Sons, Inc..
  • John, J. A.,Whitaker, D.,Triggs, C. M.. (1993). 'Construction of cyclic designs using integer programming'. Journal of statistical...
  • Lan, L.,Tai, Y. Y.,Lin, S.,Memari, B.,Honary, B.. (2008). 'New constructions of quasi-cyclic LDPC codes based on special classes of BIDBs...
  • Mead, R.. (1993). Design of Experiments: Statistical Principles for Practical Applications. Cambridge University Press.
  • Meseguer, P.,Torras, C.. (2001). 'Exploiting symmetries within constraint satisfaction search'. Artificial Intelligence. 129. 133-163
  • Prestwich, S.. (2003). '9th International Conference on Principles and Practices of Constraint Programming (CP2003)'. Springer.
  • Prestwich, S.. (2003). 'Negative effects of modeling techniques on search performance'. Annals of Operations Research. 18. 137-150
  • Puget, Jean-Francois. (2002). '8th International Conference on Principles and Practice of Constraint Programming (CP 2002)'. Springer....
  • Raghavarao, D.. (1988). Constructions and Combinatorial Problems in Design of Experiments (Paperback). Dover Publications.
  • Rodriguez, D.,Cotta, .,Leiva, A. José Fernandez. (2011). 'A memetic algorithm for designing balanced incomplete blocks'. IJCOPI. 2....
  • Rodriguez, D.,Cotta, C.,Fernandez, A.. (2009). 'Evolutionary Computation in Combinatorial Optimization 2009'. Springer.
  • Whitaker, D.,Triggs, C. M.,John, J. A.. (1990). 'Construction of block designs using mathematical programming'. Journal of the Royal...
  • Yates, F.. (1936). 'Incomplete randomized blocks'. Annals of Eugenics. 7. 121-140
  • van Lint, J.,Wilson, R.. (1992). A Course in Combinatorics. Cambridge University Press.