%0 Journal Article
%T Quasi-Physical Algorithm for the Equal Circles Packing Problem<br>求解等圆Packing问题的完全拟物算法
%A HUANG Wenqi
%A YE Tao
%A <br>黄文奇
%A 叶涛
%J 系统科学与数学
%D 2008
%I 
%X The equal circles packing problem is considered by using the quasi-physical method. Two quasi-physical strategies are presented. The first one is a quasi-physical descent algorithm, and the second is to make violent movements of the circles guided by certain physical laws. By these strategies, a unitary algorithm is given to solve the congruent circles packing problem. This algorithm is tested by the famous benchmark of packing N(N=1,2,...,100) congruent circular disks into a smallest possible circular container. This benchmark is also a clear touch stone for quality of algorithm in solving famous NP-hard problems. Comparing with previously recorded best packings, better packings for N=66,67,70,71,77,89 are found.
%K Congruent circles packing problem
%K NP hard
%K quasi-physical method
%K heuristic algorithm<br>等圆Packing问题
%K NP难度
%K 拟物方法
%K 启发式算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=4EED8E5FBA603ECC6FAA591EC6F119F2&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=5D311CA918CA9A03&sid=3A834AEE2C42102E&eid=FC20C40D27903A85&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=2&reference_num=12