SciELO - Scientific Electronic Library Online

 
vol.16 número3Búsqueda de entorno variable multiobjetivo para resolver el problema de particionamiento de datos espaciales con características poblacionalesLocalización de conjuntos compactos invariantes de sistemas físicos y electromecánicos y sus aplicaciones índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • No hay artículos similaresSimilares en SciELO

Compartir


Computación y Sistemas

versión On-line ISSN 2007-9737versión impresa ISSN 1405-5546

Resumen

CRUZ-REYES, Laura et al. Efficient Hybrid Grouping Heuristics for the Bin Packing Problem. Comp. y Sist. [online]. 2012, vol.16, n.3, pp.349-360. ISSN 2007-9737.

This article addresses a classical problem known for its applicability and complexity: the Bin Packing Problem (BPP). A hybrid grouping genetic algorithm called HGGA-BP is proposed to solve BPP. The proposed algorithm is inspired by the Falkenauer grouping encoding scheme, which applies evolutionary operators at the bin level. HGGA-BP includes efficient heuristics to genérate the initial population and performs mutation and crossover for groups as well as hybrid strategies for the arrangement of objects that were released by the group operators. The effectiveness of the algorithm is comparable with the best state-of-the-art algorithms, outperforming the published results for the class of instances hard28, which has shown the highest difficulty for algorithms that solve BPP.

Palabras llave : Computer methodologies; artificial intelligence; problem solving; bin packing problem; hybrid genetic algorithm.

        · resumen en Español     · texto en Español

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons