The 2-dimensional probabilistic bin packing problem: an average case analysis of the FBS algorithm

Authors:
Leila Horchani;Monia Bellalouna
Affiliations:
Laboratoire Cristal pôle GRIFT, ENSI Campus universitaire de la Manouba, Tunisia;ENSI, Department of Applied Mathematics, Campus universitaire de la Manouba, Tunisia
Venue:
MATH'08 Proceedings of the American Conference on Applied Mathematics
Year:
2008

Citing 5
Cited 0

A priori solution of a travelling salesman problem in which a random subset of the customers are visited

Operations Research
A priori optimization

Operations Research
Analysis of probabilistic combinatorial optimization problems in Euclidean spaces

Mathematics of Operations Research
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the probabilistic two-dimensional Bin Packing problem (2D-PBPP), one is asked to pack a random number of rectangular items, without overlap and any rotation, into the minimum number of identical square bins. In this paper we consider the re-optimization procedure used for solving probabilistic combinatorial optimization problems and an approximation of this strategy: the redistribution strategy according to an heuristic. According to computational results we show that the redistribution strategy according to FBS generates results near those given by the re-optimization strategy which is impossible to be carried out.