Abstract
Circles packing problem with equilibrium constraints is difficult to solve due to its NP-hard nature. Aiming at this NP-hard problem, three swarm intelligence algorithms are employed to solve this problem. Particle Swarm Optimization and Ant Colony Optimization has been used for the circular packing problem with equilibrium constraints. In this paper, Artificial Bee Colony Algorithm (ABC) for equilibrium constraints circular packing problem is presented. Then we compare the performances of well-known swarm intelligence algorithms (PSO, ACO, ABC) for this problem. The results of experiment show that ABC is comparatively satisfying because of its stability and applicability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
