The Generalized Bin Packing Problem under Uncertainty

نویسندگان

  • ROBERTO TADEI
  • GUIDO PERBOLI
چکیده

In this paper we introduce the Generalized Bin Packing Problem under Uncertainty, a new packing problem where, given a set of items characterized by volume and stochastic revenue and a set of bins characterized by volume and cost, we want to select a subset of items to be loaded into a subset of bins which maximizes the total profit, given by the difference between the expected total revenue of the loaded items and the total cost of the used bins, by satisfying the volume and bin availability constraints. The item revenues are random variables with unknown probability distribution. By using the asymptotic theory of extreme values a nonlinear integer deterministic model is derived. Key-Words: packing, stochastic revenue, asymptotic approximation, nonlinear integer deterministic model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...

متن کامل

Bin Packing Problem with Uncertain Volumes and Capacities

Bin packing problem is a traditional problem in combinatorial optimization and applied widely in modern society. This paper presents bin packing problem with uncertain volumes and capacities. First, two types of uncertain programming models are mathematically constructed for the uncertain bin packing problem, including expected value model and chance-constrained programming model. Next, the pro...

متن کامل

Heuristic and exact algorithms for Generalized Bin Covering Problem

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

متن کامل

The Generalized Bin Packing Problem

We introduce the Generalized Bin Packing Problem, a new packing problem where, given a set of items characterized by volume and profit and a set of bins with given volumes and costs, one aims to select the subsets of profitable items and appropriate bins to optimize an objective function combining the cost of using the bins and the profit yielded by loading the selected items. The Generalized B...

متن کامل

The Generalized Bin Packing Problem: Models and Bounds

We present the Generalized Bin Packing Problem (GBPP), a new packing problem where, given a set of items characterized by volume and profit and a set of bins with given volumes and costs, one aims to select the subsets of profitable items and appropriate bins to optimize an objective function which combines the cost of using the bins and the profit yielded by loading the selected items. The GBP...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011