Heuristic algorithm based on taboo search for sphere Packing problem
基于禁忌搜索的启发式算法求解球体Packing问题*

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.