期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
HAPE3D—a new constructive algorithm for the 3D irregular packing problem 被引量:4
1
作者 Xiao LIU Jia-min LIU +1 位作者 An-xi CAO zhuang-le yao 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2015年第5期380-390,共11页
We propose a new constructive algorithm, called HAPE3 D, 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 irregul... We propose a new constructive algorithm, called HAPE3 D, 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. HAPE3 D can deal with arbitrarily shaped polyhedrons, which can be rotated around each coordinate axis at different angles. The most outstanding merit is that HAPE3 D does not need to calculate no-fit polyhedron(NFP), which is a huge obstacle for the 3D packing problem. HAPE3 D can also be hybridized with a meta-heuristic algorithm such as simulated annealing. Two groups of computational experiments demonstrate the good performance of HAPE3 D and prove that it can be hybridized quite well with a meta-heuristic algorithm to further improve the packing quality. 展开更多
关键词 3D packing problem Layout design SIMULATION OPTIMIZATION Constructive algorithm META-HEURISTICS
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部