Journal Home Online First Current Issue Archive For Authors Journal Information 中文版

2015, Volume 16, Issue 5

Abstract

Keywords

Related Research

Back to Top

Frontiers of Information Technology & Electronic Engineering >> 2015, Volume 16, Issue 5 doi: 10.1631/FITEE.1400421

HAPE3D—a new constructive algorithm for the 3D irregular packing problem

1. School of Civil and Transportation Engineering, South China University of Technology, Guangzhou 510640, China.2. School of Information Science and Engineering, Shenyang University of Technology, Shenyang 110870, China.3. College of Ocean Science and Engineer, Shanghai Maritime University, Shanghai 201306, China

Available online: 2016-01-05
HTML24 PDF 19 Collect 0

Next Previous

Abstract

We propose a new constructive algorithm, called HAPE3D, which is a heuristic algorithm based on the principle of minimum total potential energy for the 3D irregular packing problem, involving packing a set of irregularly shaped polyhedrons into a box-shaped container with fixed width and length but unconstrained height. The objective is to allocate all the polyhedrons in the container, and thus minimize the waste or maximize profit. HAPE3D can deal with arbitrarily shaped polyhedrons, which can be rotated around each coordinate axis at different angles. The most outstanding merit is that HAPE3D does not need to calculate no-fit polyhedron (NFP), which is a huge obstacle for the 3D packing problem. HAPE3D can also be hybridized with a meta-heuristic algorithm such as simulated annealing. Two groups of computational experiments demonstrate the good performance of HAPE3D and prove that it can be hybridized quite well with a meta-heuristic algorithm to further improve the packing quality.

Related Research