An Efficient Dynamical Programming Algorithm for Bin Packing Problem

In this paper, we propose a very efficient algorithm to solve the 2 dimensional bin packing problem. The algorithm can automatically place thousands of objects in bins using less than 1 minute with very near optimal results on big size instances even if orientation of the objects is free.

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings (International Conference on Computational Science and Computational Intelligence) s. 443 - 449
Hlavní autori: Huyghe, Catherine, Negre, Stephane, Fontaine, Melanie
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 13.12.2023
Predmet:
bin packing problem
Computational intelligence
Computational modeling
dynamical programming algorithm
Full/Regular Research Paper CSCI-RTCS
heuristic
Heuristic algorithms
lower bound
Programming
Scientific computing
Solid modeling
Three-dimensional displays
ISSN:2769-5654
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we propose a very efficient algorithm to solve the 2 dimensional bin packing problem. The algorithm can automatically place thousands of objects in bins using less than 1 minute with very near optimal results on big size instances even if orientation of the objects is free.
ISSN:2769-5654
DOI:10.1109/CSCI62032.2023.00078