DeepAI AI Chat
Log In Sign Up

Comparing several heuristics for a packing problem

by   Camelia-M. Pintea, et al.

Packing problems are in general NP-hard, even for simple cases. Since now there are no highly efficient algorithms available for solving packing problems. The two-dimensional bin packing problem is about packing all given rectangular items, into a minimum size rectangular bin, without overlapping. The restriction is that the items cannot be rotated. The current paper is comparing a greedy algorithm with a hybrid genetic algorithm in order to see which technique is better for the given problem. The algorithms are tested on different sizes data.


A 4/3· OPT+2/3 approximation for big two-bar charts packing problem

Two-Bar Charts Packing Problem is to pack n two-bar charts (2-BCs) in a ...

Basic Analysis of Bin-Packing Heuristics

The bin-packing problem continues to remain relevant in numerous applica...

A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem

The Two-dimensional Bin Packing Problem calls for packing a set of recta...

One model Packs Thousands of Items with Recurrent Conditional Query Learning

Recent studies have revealed that neural combinatorial optimization (NCO...

Applying Gene Expression Programming for Solving One-Dimensional Bin-Packing Problems

This work aims to study and explore the use of Gene Expression Programmi...

A Virtual-Force Based Swarm Algorithm for Balanced Circular Bin Packing Problems

Balanced circular bin packing problems consist in positioning a given nu...

Using 3D-printing in disaster response: The two-stage stochastic 3D-printing knapsack problem

In this paper, we will shed light on when to pack and use 3D-printers in...