Two-dimensional Orthogonal Packing Problem Research Articles

A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems

In this study, a multi-objective model is proposed for a specific two-dimensional orthogonal packing problem. The model has three objectives, namely: (i) to minimise the distances between the centres of rectangular items, (ii) to use a minimisation function to place the related rectangular items close to each other, and (iii) to minimise the area of each rectangular item that falls outside of the radius. In addition to the weighted-sum method, the model uses the conic scalarisation method for scalarisation of the nonlinear multi-objective optimisation problem. The proposed model is a hybridisation of a placement procedure and a multi-objective genetic algorithm, and introduces the concept of the defensive radius to the literature. The model is tested on a randomly generated set of instances and some test problems. The computational results validate the quality of the solutions and the effectiveness of the proposed multi-objective model compared to the cluster boundary algorithm. Besides, the results show that the conic scalarisation outperforms the weighted-sum method in terms of scalar results in most cases.

An open space based heuristic for the 2D strip packing problem with unloading constraints

This paper studies the two-dimensional strip packing problem with unloading constraints. Given a set of items (represented by rectangles) belonging to different customers and a rectangular strip with fixed width and open length, the objective is to pack all the items into the strip such that the used length is minimized. In addition, the resulting packing must satisfy the unloading constraints. Based on the characteristics of this problem, this paper employs the open space to represent the candidate position. An open space based first-fit heuristic is proposed to generate a packing pattern for a given sequence of items. An implementation using the segment tree is provided. Finally, a randomized local search without any parameter is used to improve the solution by trying different sequences. The computational results on well-known instances show that the proposed approach outperforms existing approaches in the literature. In additional, we test our approach on the two-dimensional orthogonal packing problem with unloading constraints, the results show that our approach is capable of finding feasible solutions for 283 open instances.

A New Search Procedure for the Two-dimensional Orthogonal Packing Problem

In this paper we propose a new exact procedure for the two-dimensional orthog- onal packing problem, based on F. Clautiaux et al. approach (Clautiaux et al. Eur. J. Oper. Res. 183(3), 1196-1211, 2007). The principle consists in searching first the positions of the items on the horizontal axis, so as that, at each position, the sum of the heights of the items does not exceed the height of the bin. Each time a valid placement of all the items is encountered, another procedure determines if it can be extended to a solution of the pack- ing problem, searching the positions of the items on the vertical axis. Novel aspects of our approach include a simple and efficient search procedure, which only generates restricted placements, at least in a first stage, in order to reduce the search space, and the memoriza- tion of unsuccessful configurations, which are then used to detect dead-ends. We tested our implementation on a selection of orthogonal packing problems and strip packing problems, and we compared our results with those of recent successful approaches.

An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints

This paper describes an exact algorithm for solving a two-dimensional orthogonal packing problem with unloading constraints, which occurs as a subproblem of mixed vehicle routing and loading problems. The packing considered in this work is basically a feasibility problem involving a single bin. The problem is addressed through a decomposition approach wherein a branch-and-cut algorithm is designed for solving a one-dimensional relaxation of the original problem. When an integer solution is found in the branching tree, a subsidiary problem is solved to identify a two-dimensional packing that does not lead to any overlap and satisfies the unloading constraints. Cuts are added when the subsidiary problem proves to be infeasible. Several preprocessing techniques aimed at reducing the size of the solution space and uncovering infeasibility are also described. A numerical comparison with the best known exact method is reported at the end based on benchmark instances.

A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem

In this paper we address a two-dimensional (2D) orthogonal packing problem, where a fixed set of small rectangles has to be placed on a larger stock rectangle in such a way that the amount of trim loss is minimized. The algorithm we propose hybridizes a placement procedure with a genetic algorithm based on random keys. The approach is tested on a set of instances taken from the literature and compared with other approaches. The computation results validate the quality of the solutions and the effectiveness of the proposed algorithm.

A new exact method for the two-dimensional orthogonal packing problem

The two-dimensional orthogonal packing problem (2 OPP) consists in determining if a set of rectangles (items) can be packed into one rectangle of fixed size (bin). In this paper we propose two exact algorithms for solving this problem. The first algorithm is an improvement on a classical branch&bound method, whereas the second algorithm is based on a new relaxation of the problem. We also describe reduction procedures and lower bounds which can be used within enumerative methods. We report computational experiments for randomly generated benchmarks which demonstrate the efficiency of both methods: the second method is competitive compared to the best previous methods. It can be seen that our new relaxation allows an efficient detection of non-feasible instances.

A new constraint programming approach for the orthogonal packing problem

The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method for 2OPP, based on a new constraint-based scheduling model. We provide a generalization of energetic reasoning techniques for the problem under investigation. Feasibility tests requiring the solution of subset-sum problems are described. Computational results confirm the efficiency of our method compared to others in the literature.

Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

In this paper a pure meta-heuristic (genetic algorithm) and a mixed meta-heuristic (simulated annealing-genetic algorithm) were applied to two-dimensional orthogonal packing problems and the results were compared. The major motivation for applying a modified genetic algorithm is as an attempt to alleviate the problem of pre-mature convergence. We found that in the long run, the mixed heuristic produces better results; while the pure heuristic produces only “good” results, but produces them faster.

The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems

The two-dimensional orthogonal packing problem of packing identical rectangles into a large containing rectangle is important in pallet loading and has recently received much attention in O.R. publications. In this paper, we examine the conditions under which the set of feasible layouts remains unchanged and show that these conditions can be represented by a series of planes in three-dimensional space. We call this representation the three-dimensional pallet chart because it is an extension of the two-dimensional pallet charts presently used in many practical situations. The strength of this result is demonstrated by three examples of its use. Accurate two-dimensional charts are produced from the three-dimensional version with a minimum of calculation, and a complete sensitivity analysis to changes in box and pallet dimensions can be carried out visually by viewing the chart at different angles. Finally, the result is used to generate a new procedure for determining the maximum number of rectangles which can be fitted. This method is shown to be accurate for over 90% of observations in a random sample of 5000—an improvement of 20% over previous methods.