| Heuristic algorithm based on the principle of minimum total potential energy （HAPE）： a new algorithm for nesting problems |
| |
| 作者姓名： | Xiao LIU Jia-wei YE |
| |
| 作者单位： | School of Civil and Transportation Engineering, South China University of Technology, Guangzhou 510640, China |
| |
| 摘 要： |
|
Heuristic algorithm based on the principle of minimum total potential energy (HAPE): a new algorithm for nesting problems |
| |
| Xiao LIU,Jia-wei YE.Heuristic algorithm based on the principle of minimum total potential energy (HAPE): a new algorithm for nesting problems[J].Journal of Zhejiang University Science,2011,12(11):860-872. |
| |
| Authors: | Xiao Liu and Jia-wei Ye |
| |
| Abstract: | We present a new algorithm for nesting problems. Many equally spaced points are set on a sheet, and a piece is moved to one
of the points and rotated by an angle. Both the point and the rotation angle constitute the packing attitude of the piece.
We propose a new algorithm named HAPE (Heuristic Algorithm based on the principle of minimum total Potential Energy) to find
the optimal packing attitude at which the piece has the lowest center of gravity. In addition, a new technique for polygon
overlap testing is proposed which avoids the time-consuming calculation of no-fit-polygon (NFP). The detailed implementation
of HAPE is presented and two computational experiments are described. The first experiment is based on a real industrial problem
and the second on 11 published benchmark problems. Using a hill-climbing (HC) search method, the proposed algorithm performs
well in comparison with other published solutions. |
| |
| Keywords: | |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
