ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm

2006 ◽  
Vol 21 (1) ◽  
pp. 147-152 ◽  
Author(s):  
Yu Hu ◽  
Tong Jing ◽  
Zhe Feng ◽  
Xian-Long Hong ◽  
Xiao-Dong Hu ◽  
...  
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony ◽  
Minimal Tree ◽  
Steiner Minimal Tree ◽  
Tree Algorithm

scholarly journals An Efficient Rectilinear and Octilinear Steiner Minimal Tree Algorithm for Multidimensional Environments

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 48141-48150
Author(s):  
Ming Che Lee ◽  
Gene Eu Jan ◽  
Chung Chin Luo
Keyword(s):  
Minimal Tree ◽  
Steiner Minimal Tree ◽  
Tree Algorithm

scholarly journals X-architecture Steiner minimal tree algorithm based on multi-strategy optimization discrete differential evolution

2021 ◽  
Vol 7 ◽  
pp. e473
Author(s):  
Genggeng Liu ◽  
Liliang Yang ◽  
Saijuan Xu ◽  
Zuoyong Li ◽  
Yeh-Cheng Chen ◽  
...  
Keyword(s):  
Differential Evolution ◽  
Global Routing ◽  
Wire Length ◽  
Minimal Tree ◽  
Steiner Minimal Tree ◽  
Tree Algorithm ◽  
Learning Factor ◽  
X Architecture ◽  
Elite Selection ◽  
Discrete Differential Evolution

Global routing is an important link in very large scale integration (VLSI) design. As the best model of global routing, X-architecture Steiner minimal tree (XSMT) has a good performance in wire length optimization. XSMT belongs to non-Manhattan structural model, and its construction process cannot be completed in polynomial time, so the generation of XSMT is an NP hard problem. In this paper, an X-architecture Steiner minimal tree algorithm based on multi-strategy optimization discrete differential evolution (XSMT-MoDDE) is proposed. Firstly, an effective encoding strategy, a fitness function of XSMT, and an initialization strategy of population are proposed to record the structure of XSMT, evaluate the cost of XSMT and obtain better initial particles, respectively. Secondly, elite selection and cloning strategy, multiple mutation strategies, and adaptive learning factor strategy are presented to improve the search process of discrete differential evolution algorithm. Thirdly, an effective refining strategy is proposed to further improve the quality of the final Steiner tree. Finally, the results of the comparative experiments prove that XSMT-MoDDE can get the shortest wire length so far, and achieve a better optimization degree in the larger-scale problem.

Parallel Ant Colony Optimization on the University Course-Faculty Timetabling Problem in MSU-IIT

2012 ◽  
Author(s):  
Earth B. Ugat ◽  
Jennifer Joyce M. Montemayor ◽  
Mark Anthony N. Manlimos ◽  
Dante D. Dinawanao
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony ◽  
Timetabling Problem ◽  
University Course ◽  
The University
Sign in / Sign up

Export Citation Format

Share Document