An Efficient Dynamical Programming Algorithm for Bin Packing Problem - Université de Picardie Jules Verne Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

An Efficient Dynamical Programming Algorithm for Bin Packing Problem

Résumé

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.
Fichier non déposé

Dates et versions

hal-04660437 , version 1 (23-07-2024)

Identifiants

Citer

Catherine Huyghe, Stéphane Nègre, Mélanie Fontaine. An Efficient Dynamical Programming Algorithm for Bin Packing Problem. 2023 International Conference on Computational Science and Computational Intelligence (CSCI), Dec 2023, Las Vegas, United States. pp.443-449, ⟨10.1109/CSCI62032.2023.00078⟩. ⟨hal-04660437⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More