An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem

Authors:
Y. Cui;T. Gu;W. Hu
Affiliations:
Department of Computer Science, Guangxi Normal University, Guilin, Peoples Republic of China;Department of Computer Science, Guilin University of Electronic Technology, Guilin, Peoples Republic of China;Library, Guangxi Normal University, Guilin, Peoples Republic of China
Venue:
Optimization Methods & Software
Year:
2008

Citing 7
Cited 0

Best-first search methods for constrained two-dimensional cutting stock problems

Operations Research
An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock

Computers and Operations Research
Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

INFORMS Journal on Computing
Recent advances on two-dimensional bin packing problems

Discrete Applied Mathematics
An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems

Operations Research
Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patterns

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm for the constrained, two-dimensional, rectangular multiple identical large object placement problem, where a set of small rectangular items must be cut from a specified number of identical plates, so as to maximize the value of the cut items. The algorithm generates optimal homogenous T-shape patterns that contain only homogenous strips. A homogenous strip contains items of the same type. A cut divides the plate into two segments. Each segment consists of strips with the same direction. The strips in the first segment are horizontal, and those in the second segment are vertical. The algorithm is based on the bottom-up tree-search approach. Both lower and upper bounds are used to prune the search tree. The computational results indicate that the algorithm is capable of solving problems of small and medium scales.