A quasi-physical algorithm based on coarse and fine adjustment for solving circles packing problem with constraints of equilibrium

被引:2
作者
机构
[1] School of Computer Science and Technology, Huazhong University of Science and Technology
来源
He, K. (brooklet60@gmail.com) | 1600年 / Science Press卷 / 36期
关键词
Coarse and fine adjustment; Equilibrium constraints; Layout optimization; Packing problem; Quasi-physical;
D O I
10.3724/SP.J.1016.2013.01224
中图分类号
学科分类号
摘要
The circles packing problem with constraints of equilibrium, as a two-dimensional packing problem with the background of satellite module layout design, is an NP hard layout optimization problem. A mathematical model and two new physical models are established for this problem. And inspired by the process of coarse and fine adjustment in the industry, a Quasi-Physical algorithm based on Coarse and Fine Adjustment (QPCFA) is proposed. Not only can QPCFA keep the diversity of the searching space to facilitate the global search, but also it can do fine search in promising local areas to find the corresponding local optimal solutions. Moreover, the taboo method and the jump pit strategy are combined to improve the performance of this algorithm. Experiments on 11 representative instances show that QPCFA achieve new and better results on seven ones and matched the current best records on the other four. In addition, the calculation accuracy is improved considerably.
引用
收藏
页码:1224 / 1234
页数:10
相关论文
共 13 条
[1]  
Xu Y.-C., Xiao R.-B., Ant colony algorithm for layout optimization with equilibrium constraints, Control and Decision, 23, 1, pp. 25-29, (2008)
[2]  
Tang F., Teng H.-F., A modified genetic algorithm and its application to layout optimization, Journal of Software, 10, 10, pp. 1096-1102, (1999)
[3]  
Huang W.-Q., Zhan S.-H., A quasiphysical method for solving circles packing problem, Acta Mathematicae Applicatae Sinica, 2, 2, pp. 176-180, (1979)
[4]  
Huang W.-Q., Xu R.-C., Modern Theory of Computation Guide-NP Hard Problem in the Background, Foreground and its Algorithm, pp. 47-70, (2004)
[5]  
Huang W.-Q., Mao C., Note on: An improved algorithm for the packing of unequal circles within a larger containing circle, Computers & Industrial Engineering, 50, pp. 338-344, (2006)
[6]  
He K., Huang W.-Q., A quasi-human algorithm for solving the three-dimensional rectangular packing problem, Science China (Information Sciences), 40, 12, pp. 1586-1595, (2010)
[7]  
Liu J., Huang W.-Q., A fast local search algorithm for solving circles packing problem with constraints of equilibrium, Journal of Image and Graphics, 13, 5, pp. 991-997, (2008)
[8]  
Wang Y.-S., Shi Y.-J., Teng H.-F., An improved scatter search for circles packing problem with the equilibrium constraint, Chinese Journal of Computers, 32, 6, pp. 1214-1221, (2009)
[9]  
Liu J.-F., Li G., Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints, Science China (Information Sciences), 40, 3, pp. 423-432, (2010)
[10]  
Lei K.-Y., Qiu Y.-H., A study of constrained layout optimization using adaptive particle swarm optimizer, Journal of Computer Research and Development, 43, 10, pp. 1724-1731, (2006)