Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem: Notations

Written by heuristicsearch | Published 2024/04/15
Tech Story Tags: heuristic-algorithms | computational-optimization | meta-heuristic | matheuristic-algorithm | colorful-bin-packing-problem | bin-packing-problem | cbpp-heuristics | two-by-two-heuristic

TLDRThe 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. via the TL;DR App

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.


Written by heuristicsearch | Efficiently exploring and navigating large solution spaces at HeuristicsSearch.Tech
Published by HackerNoon on 2024/04/15