Efficient Hybrid Grouping Heuristics for the Bin Packing Problem
Bin packing problem
Heuristics
DOI:
10.13053/cys-16-3-1402
Publication Date:
2012-09-22
AUTHORS (6)
ABSTRACT
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 inspired by Falkenauer encoding scheme, which applies evolutionary operators at bin level. includes efficient heuristics generate initial population performs mutation crossover groups as well strategies arrangement of objects that were released group operators. effectiveness comparable with best state-of-the-art algorithms, outperforming published results class instances hard28, has shown highest difficulty algorithms BPP
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES ()
CITATIONS ()
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....