A genetic algorithm for two-dimensional bin packing with due dates
نویسندگان
چکیده
منابع مشابه
A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
The two-dimensional non-oriented bin packing problem with due dates packs a set of rectangular items, which may be rotated by 90 degrees, into identical rectangular bins. The bins have equal processing times. An item’s lateness is the difference between its due date and the completion time of its bin. The problem packs all items without overlap as to minimize maximum lateness Lmax. The paper pr...
متن کاملA hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
The three-dimensional bin packing problem is a practical problem faced in modern industrial processes such as container ship loading, pallet loading, plane cargo management, and warehouse management. This article considers a three-dimensional bin packing problem in which objects of various volumes are packed into a single bin to maximize the number of objects packed. The bin packing problem ini...
متن کاملImproved Approximation Algorithm for Two-Dimensional Bin Packing
We study the two-dimensional bin packing problem with and without rotations. Here we are given a set of two-dimensional rectangular items I and the goal is to pack these into a minimum number of unit square bins. We consider the orthogonal packing case where the edges of the items must be aligned parallel to the edges of the bin. Our main result is a 1.405approximation for two-dimensional bin p...
متن کاملAn Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed nonoverlapping and orthogonal, i.e., axis-parallel. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided P 6= NP.
متن کاملA Three-dimensional Bin Packing Algorithm
In this paper an approximation algorithm for the three-dimensional bin packing problem is proposed and its performance bound is investigated. To obtain such a bound a modified bin packing algorithm is considered for a two-dimensional problem with bounded bin and its area utilization is estimated. Finally, a hard example gives a lower bound of the performance bound. '
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Economics
سال: 2013
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2013.04.040