Basic Analysis of Bin-Packing Heuristics

04/25/2021
by   Bastian Rieck, et al.
1

The bin-packing problem continues to remain relevant in numerous application areas. This technical report discusses the empirical performance of different bin-packing heuristics for certain test problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2012

Comparing several heuristics for a packing problem

Packing problems are in general NP-hard, even for simple cases. Since no...
research
02/14/2017

Small Boxes Big Data: A Deep Learning Approach to Optimize Variable Sized Bin Packing

Bin Packing problems have been widely studied because of their broad app...
research
11/01/2021

A generalized algorithm and framework for online 3-dimensional bin packing in an automated sorting center

Online 3-dimensional bin packing problem (O3D-BPP) is getting renewed pr...
research
04/09/2021

Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes

We consider the irregular strip packing problem of rasterized shapes, wh...
research
06/22/2022

Kafka Consumer Group Autoscaler

Message brokers enable asynchronous communication between data producers...
research
05/25/2020

Learnability of Timescale Graphical Event Models

This technical report tries to fill a gap in current literature on Times...
research
02/10/2023

A Monte Carlo packing algorithm for poly-ellipsoids and its comparison with packing generation using Discrete Element Model

Granular material is showing very often in geotechnical engineering, pet...

Please sign up or login with your details

Forgot password? Click here to reset