求解不等圆Packing问题的一个启发式算法.pdfVIP

计算机研究与发展 ISSN 1000—1239／CN 1 1-1777／TP Journal of Computer Research and Development 44(12)：2092～2097，2007 求解不等圆Packing问题的一个启发式算法 陈 矛 黄文奇 (华中师范大学教育信息技术工程研究中心 武汉 430079) (华中科技大学计算机科学与技术学院 武汉 430074) (mchen_1@163．com) A Heuristic Algorithm for the Unequal Circle Packing Problem Chen Mao · and Huang Wenqi (Engineering Center for Educational Information Technology，Huazhong Normal University，Wuhan 430079) (School ofComputer ScienceTechnology，Huazhong UniversityofScience and Technology，Wuhan 430074) Abstract Circle packing problem，one of the NP hard problems，is of great theoretical and practical value． To solve the circle packing problem that encounters in the field of transportation of freight，a heuristic algorithm is proposed for finding a good arrangement of multiple different—sized circles within a larger rectangular container．In this algorithm，the circles are sorted by non—increasing order of radius and packed into the container one by one according to the order．Each circle should be placed inside the container by a corner placement SO that the circle does not overlap any other circle and is tangent with two previously packed circles．By pseudo—placing one or more circles to be packed，two greedy methods are introduced to evaluate the benefit of a corner placement，one of which is the degree of placement，and the other is a bounded enumeration strategy that is based on the first one．At each iteration of packing in the resulting algorithm，each circle is packed into the container by a corner placement with the highest benefit according to the bounded enumeration strategy．The experimentaI results are presented，showing the effectiveness of this algorithm． Key words NP—hard problem；circle packing problem；heuristic algorithm；corner placement；bounded enumeration 摘 要 求解具有NP难度的圆形packing问题具有很高的理论与实用