Note on: An improved algorithm for the packing of unequal circles within a larger containing circle
Note on: An improved algorithm for the packing of unequal circles within a larger containing circle
复制标题
DOI：
10.1016/j.cie.2006.06.004
复制
发表时间：
2006-07
期刊：
影响因子：
--
通讯作者：
Wenqi Huang;Mao Chen
中科院分区：
文献类型：
--
作者：
Wenqi Huang;Mao Chen
本文对Wang等人提出的算法[Wang，H.问：黄，W.问：张，Q，& Xu，D. M.（2002年）的报告。一种改进的不等圆在较大包容圆内的填充算法。European Journal of Operational Research，141，339-347]，用于求解具有平衡约束的圆盘包装问题。在梯度法中引入了一种有效的加速搜索策略，以缩短搜索时间。大量的计算结果表明，所提出的方法的有效性。
This note proposed an improved version of the algorithm proposed by Wang et al. [Wang, H. Q., Huang, W. Q., Zhang, Q., & Xu, D. M. (2002). An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research, 141, 339–347] for solving the disk packing problem with equilibrium constraints. An efficient strategy of accelerating the search process is introduced in the gradient method to shorten the execution time. A number of computational results are presented, showing the effectiveness of the proposed method.