Name
Abstract | ||
|---|---|---|
•A highly efficient heuristic algorithm for 2D rectangular packing problem.•A angle-occupying based packing strategy is proposed to pack the rectangles.•Local and global evaluation criteria are proposed to assess the benefit of a placement.•A multi-start strategy is introduced to explore more regions of the search space.•The proposed algorithm achieves competitive results on two sets of benchmark sets. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cie.2019.106097 | Computers & Industrial Engineering |
Keywords | Field | DocType |
Packing,Two-dimensional rectangular packing problem,Angle-occupying placement,Multistart strategy | Mathematical optimization,Packing problems,Constructive,Heuristic (computer science),Rectangle,Engineering | Journal |
Volume | ISSN | Citations |
137 | 0360-8352 | 2 |
PageRank | References | Authors |
0.37 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mao Chen | 1 | 2 | 0.37 |
| Chao Wu | 2 | 2 | 0.37 |
| Xiangyang Tang | 3 | 19 | 11.38 |
| Xicheng Peng | 4 | 3 | 2.08 |
| Zhizhong Zeng | 5 | 10 | 2.14 |
| Sanya Liu | 6 | 27 | 7.40 |