Approximate algorithms for constrained circular cutting problems
Computers and Operations Research
Layout optimization of satellite module using soft computing techniques
Applied Soft Computing
A particle swarm optimization algorithm for the multiple-level warehouse layout design problem
Computers and Industrial Engineering
A Fast Heuristic Ant Colony Approach for Weighted Circles Layout Problem
IITA '09 Proceedings of the 2009 Third International Symposium on Intelligent Information Technology Application - Volume 03
A particle swarm optimization for the single row facility layout problem
Computers and Industrial Engineering
A dual-system variable-grain cooperative coevolutionary algorithm: satellite-module layout design
IEEE Transactions on Evolutionary Computation
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.09 |
The weighted circle packing problem is a kind of important combination optimization problem and has the NP-hard property. Inspired by the No Free Lunch Theorem, a knowledge-based heuristic particle swarm optimization approach with the adjustment strategy (KHPSOA) is developed for this problem. The knowledge (e.g., the relation between its weight matrix and better solution) is obtained from this problem itself and existing layout scheme diagrams and applied to form more effective ordering and positioning rules of the proposed heuristic method. A better layout scheme of larger circles is obtained through the heuristic method. The optimal solution of this problem is obtained by inserting a few residual smaller circles into the gaps of the better layout scheme and further optimizing it through the proposed particle swarm optimization with the adjustment strategy. The numerical experiments show that KHPSOA is superior to the existing algorithms in the performances.