期刊
OPTIMIZATION
卷 64, 期 12, 页码 2601-2618出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2013.877906
关键词
global optimization; three-dimensional rectangular packing; open dimension problems; piecewise linearization
资金
- Taiwan NSC [NSC 101-2410-H-158-002-MY2, NSC 102-2410-H-027-012-MY3]
The three-dimensional open dimension rectangular packing problem (3D-ODRPP) aims to pack a set of given rectangular boxes into a large rectangular container of minimal volume. This problem is an important issue in the shipping and moving industries. All the boxes can be any rectangular stackable objects with different sizes and may be freely rotated. The 3D-ODRPP is usually formulated as a mixed-integer non-linear programming problem. Most existing packing optimization methods cannot guarantee to find a globally optimal solution or are computationally inefficient. Therefore, this paper proposes an efficient global optimization method that transforms a 3D-ODRPP as a mixed-integer linear program using fewer extra 0-1 variables and constraints compared to existing deterministic approaches. The reformulated model can be solved to obtain a global optimum. Experimental results demonstrate the computational efficiency of the proposed approach in globally solving 3D-ODRPPs drawn from the literature and the practical applications.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据