Variable Neighborhood Search for the Bin Packing Problem with Compatible Categories

05/09/2019
by   Luiz F. O. Moura Santos, et al.
0

Bin Packing with Conflicts (BPC) are problems in which items with compatibility constraints must be packed in the least number of bins, not exceeding the capacity of the bins and ensuring that non-conflicting items are packed in each bin. In this work, we introduce the Bin Packing Problem with Compatible Categories (BPCC), a variant of the BPC in which items belong to conflicting or compatible categories, in opposition to the item-by-item incompatibility found in previous literature. It is a common problem in the context of last mile distribution to nanostores located in densely populated areas. To efficiently solve real-life sized instances of the problem, we propose a Variable Neighborhood Search (VNS) metaheuristic algorithm. Computational experiments suggest that the algorithm yields good solutions in very short times while compared to linear integer programming running on a high-performance computing environment.

READ FULL TEXT
research
11/30/2018

Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation

Bin Packing with Minimum Color Fragmentation (BPMCF) is an extension of ...
research
05/12/2021

Open-end bin packing: new and old analysis approaches

We analyze a recently introduced concept, called the price of clustering...
research
03/01/2023

Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers

Efficient packing of items into bins is a common daily task. Known as Bi...
research
01/20/2020

Adaptive Large Neighborhood Search for Circle Bin Packing Problem

We address a new variant of packing problem called the circle bin packin...
research
01/27/2021

Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses

Different retail and e-commerce companies are facing the challenge of as...
research
01/23/2017

Constraint programming for planning test campaigns of communications satellites

The payload of communications satellites must go through a series of tes...
research
06/30/2022

A Constructive Heuristic Algorithm for 3D Bin Packing of Irregular Shaped Items

The three-dimensional bin packing problem (3D-BPP) plays an important ro...

Please sign up or login with your details

Forgot password? Click here to reset