Computing optimal rectilinear Steiner trees: a survey and experimental evaluation
Discrete Applied Mathematics - Special volume on VLSI
Encoding rectilinear Steiner trees as lists of edges
Proceedings of the 2001 ACM symposium on Applied computing
Optimization of Steiner Trees Using Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
A comprehensive survey of fitness approximation in evolutionary computation
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Set of test problems for the minimum length connection networks
ACM SIGMAP Bulletin
An evolution algorithm for the rectilinear steiner tree problem
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
| Hi-index | 0.00 |
The rectilinear Steiner tree problem (RSTP) is to find a minimum-length rectilinear interconnection of a set of terminals in the plane. A key performance measure of the algorithm for the RSTP is the reduction rate that is achieved by the difference between the objective value of the RSTP and that of the minimum spanning tree without Steiner points. We introduced four evolutionary algorithm based upon fitness estimation and hybrid operator. Experimental results show that the quality of solution is improved by the hybrid operator and the calculation time is reduced by the fitness estimation. The best evolutionary algorithm is better than the previously proposed other heuristics. The solution of evolutionary algorithm is 99.4% of the optimal solution.