.png){kind=icon}
.png){kind=icon}
Return
PERM for solving circle packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2006.10.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we develop a new algorithm that incorporates the improved PERM into an already existing simple deterministic heuristic, the principle of maximum cave degree for corner-occupying actions, to solve the problem of packing equal or unequal circles into a larger circle container. We compare the performance of our algorithm on several problem instances taken from the literature with previous algorithms. The computational results show that the proposed approach produces high-quality solutions within reasonable computational times. Although our algorithm is less efficient than Zhang's for several large-scale equal-size instances, it is noteworthy that for several unequal circle instances we found new lower bounds missed in previous papers. (c) 2006 Elsevier Ltd. All rights reserved.
Keywords:
circle packing
PERM
corner-occupying action
cave degree
NP-hard
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available