A Hybrid Algorithm for the Circular Packing Problem with Constraint of Equilibrium

The circular packing problem is widely found in applications such as production, shipbuilding and aerospace. By combining simulated annealing with particle swarm optimization, a hybrid algorithm for the circular packing problem with constraint of equilibrium is presented. In order to enhance algorithm´s search ability and get out of local minima, some strategies can be used such as eliminating overlapping, inner attraction, exterior press, twice cycle. The computated results of example are provided and compared with that of some other algorithms.