Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem: Notations by@heuristicsearch
Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem: Notations
by Aiding in the focused exploration of potential solutions.April 15th, 2024
Too Long; Didn't Read
The Colorful Bin Packing Problem (CBPP) presents unique challenges due to color constraints in bin allocation. This article introduces novel heuristics, meta-heuristic algorithms like Variable Neighborhood Search (VNS), and a matheuristic approach to efficiently solve CBPP instances. Results indicate near-optimal solutions even for large datasets, making significant strides in computational optimization for this NP-hard problem.
Authors:
(1) Renan F. F. da Silva, Institute of Computing, University of Campinas;
(2) Yulle G. F. Borges, Institute of Computing, University of Campinas;
(3) Rafael C. S. Schouery, Institute of Computing, University of Campinas.
3 Notations
This paper is available on arxiv under CC 4.0 license.
L O A D I N G
. . . comments & more!
. . . comments & more!
