Name
Abstract | ||
|---|---|---|
•A greedy heuristic algorithm for packing equal circles into a circular container.•A new evaluation criterion is designed to assess the benefit of a packing action.•An efficient heuristic enumeration is proposed to find the smallest container.•The algorithm achieves competitive results on two sets of benchmark sets.•The effects of important components of the proposed algorithm are analyzed. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.cie.2018.03.030 | Computers & Industrial Engineering |
Keywords | Field | DocType |
Heuristics,Circle packing,Combinatorial optimization,Heuristic enumeration | Heuristic,Mathematical optimization,Enumeration,Algorithm,Greedy algorithm,Engineering,Circle packing,Packing procedure | Journal |
Volume | ISSN | Citations |
119 | 0360-8352 | 0 |
PageRank | References | Authors |
0.34 | 9 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mao Chen | 1 | 1 | 3.07 |
| Xiangyang Tang | 2 | 19 | 11.38 |
| Ting Song | 3 | 31 | 6.15 |
| Zhizhong Zeng | 4 | 10 | 2.14 |
| Xicheng Peng | 5 | 3 | 2.08 |
| Sanya Liu | 6 | 21 | 2.88 |