X-architecture Steiner Minimum Tree Algorithm Considering Routing Resource Relaxation

被引：0
|
作者：
Tang H. [1 ,2 ]
Liu G. [1 ,2 ,3 ]
Guo W. [1 ,2 ,3 ]
Chen G. [1 ,2 ]
机构：
[1] College of Mathematics and Computer Sciences, Fuzhou University, Fuzhou
[2] Key Laboratory of Networking Computing and Intelligent Information Processing, Fujian Province, Fuzhou University, Fuzhou
[3] Key Laboratory of Spatial Data Mining and Information Sharing, Ministry of Education, Fuzhou University, Fuzhou
来源：
Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence | 2020年 / 33卷 / 05期
基金：
中国国家自然科学基金;
关键词：
Corner Point Selection; Particle Swarm Optimization; Refinement Strategy; Steiner Minimum Tree; X-architecture Routing;
D O I：
10.16451/j.cnki.issn1003-6059.202005003
中图分类号：
学科分类号：
摘要：
To further study X-architecture and make full use of routing resources within the obstacle, an X-architecture Steiner minimum tree algorithm considering routing resource relaxation is proposed in this paper. Firstly, crossover and mutation operators are introduced in the update operation of particles to solve the discretization problem. Secondly, look-up tables are presented for the whole algorithm process to provide a fast information query. Thirdly, a corner point selection strategy is proposed to introduce some obstacle corner points and satisfy the constraints. Finally, a refinement strategy is implemented to further improve the quality of the final routing tree. Experimental results show that the proposed algorithm makes full use of the routing resources within the obstacle, shortens the total wirelength effectively and achieves a better total wirelength. © 2020, Science Press. All right reserved.
引用
收藏
页码：401 / 412
页数：11
相关论文
共 35 条
  • [31] YAZDANINEJADI A, GOLSHANNAVAZ S, NAZARPOUR D, Et al., Dual-Setting Directional Overcurrent Relays for Protecting Automated Distribution Networks, IEEE Transactions on Industrial Informatics, 15, 2, pp. 730-740, (2019)
  • [32] LIU G G, CHEN Z S, GUO W Z, Et al., Self-adapting PSO Algorithm with Efficient Hybrid Transformation Strategy for X-architecture Steiner Minimal Tree Construction Algorithm, Pattern Recognition and Artificial Intelligence, 31, 5, pp. 398-408, (2018)
  • [33] ZHOU H Y, WANG X G, CUI N G., A Novel Reentry Trajectory Generation Method Using Improved Particle Swarm Optimization, IEEE Transactions on Vehicular Technology, 68, 4, pp. 3212-3223, (2019)
  • [34] GUO W Z, CHEN X H, LIU G G, Et al., Track Assignment Algorithm Based on Hybrid Discrete Particle Swarm Optimization, Pattern Recognition and Artificial Intelligence, 32, 8, pp. 758-770, (2019)
  • [35] RATNAWEERA A, HALGAMUGE S K, WATSON H C., Self-organizing Hierarchical Particle Swarm Optimizer with Time-Varying Acceleration Coefficients, IEEE Transactions on Evolutionary Computation, 8, 3, pp. 240-255, (2004)
1234