A Fast Local Search Algorithm for Solving Circles Packing Problem with Constraints of Equilibrium[J]. Journal of Image and Graphics, 2008, 13(5): 991-997. DOI: 10.11834/jig.20080523.
The optimal layout problem of circle group in a circular container with performance constraints of equilibrium belong to NP hard problem. A fast local serach algorithm (LS) is presented for solving this problem. Firstly
the method constructs an equivalent physical model and defines the energy function of the system. Then the energy function is optimized by the steepest descent method and the approximation solution is obtained indirectly. In order to improve the computational efficiency
the accelerating strategy is added to the LS algorithm. Two examples are computed numerically
and the results of the experiment show the feasibility and efficiency of the approach.