TL;DR —
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.
2 Colorful Bin Packing Problem
This paper is available on arxiv under CC 4.0 license.
[story continues]
Written by
@heuristicsearch
Efficiently exploring and navigating large solution spaces at HeuristicsSearch.Tech
Topics and
tags
tags
heuristic-algorithms|computational-optimization|meta-heuristic|matheuristic-algorithm|colorful-bin-packing-problem|bin-packing-problem|cbpp-heuristics|two-by-two-heuristic
This story on HackerNoon has a decentralized backup on Sia.
Transaction ID: UUGlqzTBcBJIuyLeH5GC4u86U-Vklzb2ba2dNRZfNh0