Perturbation-based approach for solving arbitrary sized circle Packing problem
基于格局变换策略的不等圆Packing问题求解算法*

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.