基于格局变换策略的不等圆Packing问题求解算法*

采用基于格局变换策略的算法ACP-Solver求解不等圆Packing问题。ACP-Solver由连续优化方法、格局变换算子和接收准则组成。连续优化方法可从任一初始格局收敛至对应的局部最优格局。格局变换算子将当前格局变换为新格局。接收准则决定是否接收变换所得格局。基于24个国际公开算例的计算实验表明，ACP-Solver能在可接受的计算时间内改进或持平绝大多数算例的当前最优记录。实验结果表明了ACP-Solver的高效性能。

Perturbation-based approach for solving arbitrary sized circle Packing problem

This paper proposed a perturbation-based approach named ACP-Solver which consisted of a continuous optimization method, several perturbation operators and an acceptance criterion for solving ACP. Used the continuous optimization method to obtain a local optimal configuration from any initial configuration. Used the perturbation operators to perturb the incumbent configuration to new configurations. The acceptance criterion determined whether or not to accept a perturbed configuration. Computational experiments based on 24 representative instances show that ACP-Solver succeed in improving or matching most of the best known results within reasonable time. The performance of ACP-Solver in comparison with previous approaches demonstrates that ACP-Solver is a competitive algorithm for solving ACP.