SciELO - Scientific Electronic Library Online

 
vol.16 issue3Multi-Objective Variable Neighborhood Search to Solve the Problem of Partitioning of Spatial Data with Population CharacteristicsLocalization of Compact Invariant Sets of Physical and Electromechanical Systems and their Applications author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Computación y Sistemas

On-line version ISSN 2007-9737Print version ISSN 1405-5546

Abstract

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.

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

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License