%0 Journal Article
%T Heuristic algorithm based on taboo search for sphere Packing problem<br>基于禁忌搜索的启发式算法求解球体Packing问题*
%A LIU Jing-fa
%A ZHOU Guo-cheng
%A PAN Jin-jib
%A <br>刘景发
%A 周国城
%A 潘锦基b
%J 计算机应用研究
%D 2011
%I 
%X To solve the sphere packing problem which is a NP-hard problem, a heuristic algorithm which combines the taboo search algorithm with the gradient descent method based on the adaptive step length and dichotomous search is proposed. 50 equal sphere instances are tested. The proposed algorithm approves the results of 44 instances obtained by previous algorithms. The computational results show that this heuristic algorithm is an effective algorithm for the sphere packing problem.
%K Sphere packing problem
%K Heuristic algorithm
%K Taboo search algorithm
%K Gradient descent method
%K dichotomous search<br>球体Packing问题
%K 启发式算法
%K 禁忌搜索算法
%K 梯度下降法
%K 二分法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=6A1AA643747CDEE9B6F1C8CF5285C314&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=38B194292C032A66&sid=CC5564FFEBD22614&eid=117143DBED3B4430&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=6