paint-brush
Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem: Matheuristic Algorithmsby@heuristicsearch

Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem: Matheuristic Algorithms

tldt arrow

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.
featured image - Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem: Matheuristic Algorithms
Aiding in the focused exploration of potential solutions. HackerNoon profile picture

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.


7 Matheuristic

This paper is available on arxiv under CC 4.0 license.