Solving a New 3D Bin Packing Problem with Deep Reinforcement Learning Method
نویسندگان
چکیده
In this paper, a new type of 3D bin packing problem (BPP) is proposed, in which a number of cuboidshaped items must be put into a bin one by one orthogonally. The objective is to find a way to place these items that can minimize the surface area of the bin. This problem is based on the fact that there is no fixed-sized bin in many real business scenarios and the cost of a bin is proportional to its surface area. Our research shows that this problem is NP-hard. Based on previous research on 3D BPP, the surface area is determined by the sequence, spatial locations and orientations of items. Among these factors, the sequence of items plays a key role in minimizing the surface area. Inspired by recent achievements of deep reinforcement learning (DRL) techniques, especially Pointer Network, on combinatorial optimization problems such as TSP, a DRL-based method is applied to optimize the sequence of items to be packed into the bin. Numerical results show that the method proposed in this paper achieve about 5% improvement than heuristic method.
منابع مشابه
Analysis of STAGE Algorithm Based on Solving Bin Packing Problem
Previous researches have shown the success of using Reinforcement Learning in solving combinatorial optimization problems. The main idea of these methods is to learn (near) optimal evaluation functions to improve local searches and find (near) optimal solutions. STAGE algorithm, introduced by Boyan & Moore, is one of the most important algorithms in this area. In this paper, we focus on Bin-Pac...
متن کامل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...
متن کاملCost Function Optimization based on Active Learning
Optimization is one of the most important issues in all fields of science and engineering. There are two main categories for optimization problems: continues optimization and discrete optimization. Traditional methods, such as gradient descent, are used for solving continues optimization problems, But for discrete optimization, traditional and many new algorithms are introduced. Due to long tim...
متن کاملAbstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...
متن کاملCollective Bin Packing: an Active Learning Exercise*
Active learning has become an important part of effective computer science pedagogy. Active learning helps to keep students engaged in the learning process and is useful at all levels of computer science education from introductory courses on programming through more advanced upper level topics and graduate level coursework. In this paper, we present an active learning exercise that we develope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1708.05930 شماره
صفحات -
تاریخ انتشار 2017