A two-dimensional vector packing model for the efficient use of coil cassettes

Authors:
Soo Y. Chang;Hark-Chin Hwang;Sanghyuck Park
Affiliations:
Department of Industrial Engineering, Division of Electrical and Computer Engineering, Pohang University of Science and Technology, Hyoja Dong San 31, Pohang, Kyungbuk 790-784, Republic of Korea;Department of Industrial Engineering, Chosun University, 375 Seosuk-Dong, Dong-Gu, Gwangju 501-759, Republic of Korea;Department of Industrial Engineering, Division of Electrical and Computer Engineering, Pohang University of Science and Technology, Hyoja Dong San 31, Pohang, Kyungbuk 790-784, Republic of Korea
Venue:
Computers and Operations Research
Year:
2005

Citing 6
Cited 2

A branch-and-bound algorithm for the two-dimensional vector packing problem

Computers and Operations Research
There is no asymptotic PTAS for two-dimensional vector packing

Information Processing Letters
On multi-dimensional packing problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
New Algorithms for Bin Packing

Journal of the ACM (JACM)
Lower bounds and algorithms for the 2-dimensional vector packing problem

Discrete Applied Mathematics
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing

Operations Research Letters

Iterative approaches for solving a multi-objective 2-dimensional vector packing problem

Computers and Industrial Engineering
Review Article: Self-adaptive metaheuristics for solving a multi-objective 2-dimensional vector packing problem

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of efficiently packing steel products, known as coils, into special containers, called cassettes for shipping. The objective is to minimize the number of cassettes used for packing all the given coils where each cassette has capacity limits on both total payload weight and size. We model this problem as a two-dimensional vector packing problem and propose a heuristic. We also analyze the worst-case performance of the proposed algorithm under a special condition which, in fact, holds for the particular real-world case that we handled. Our computational experiment with real production data shows that the proposed algorithm performs quite satisfactorily in practice.