Abstract
As the best connection model for the multi-pin net of the non-Manhattan architecture global routing problem, the X-architecture Steiner Minimum Tree (XSMT) construction is a Non-deterministic Polynomial hard (NP-hard) problem. The Differential Evolution (DE) algorithm has shown good application effect in solving various NP-hard problems. For this reason, based on the idea of DE algorithm, this paper proposes an XSMT construction algorithm for solving this problem. First of all, because the traditional DE algorithm is designed for continuous problems, the optimization ability is limited in solving discrete problems. This paper proposes a novel crossover operator and mutation operator. At the same time, in order to maintain the effectiveness of the evolutionary algorithm, an Edge-to-Point coding strategy suitable for evolutionary algorithms is proposed to better preserve the optimal substructure of the population. Finally, in order to speed up the convergence speed and quality of the algorithm, this paper proposes an initial solution based on the minimum tree generation algorithm. Experiments show that the effectiveness of the proposed algorithm and related strategies can construct a high-quality XSMT solution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826–834 (1977)
Lavagno, L., Markov, I.L., Martin, G., et al.: Electronic Design Automation for IC Implementation, Circuit Design, and Process Technology: Circuit Design, and Process Technology. CRC Press, Boca Raton (2016)
Stroud, C.E., Wang, L.T., Chang, Y.W.: Chapter 1: Introduction. In: Ang, L.T., Chang, Y.W., Cheng, K.T., Electronic Design Automation: Synthesis, Verification, and Testing, pp. 1–38, Elsevier/Morgan Kaufmann (2009)
Liu, G.G., Chen, G.L., Guo, W.Z., et al.: DPSO-based rectilinear Steiner minimal tree construction considering bend reduction. In: Proceeding of the 7th International Conference on Natural Computation, pp. 1161–1165 (2011)
Held, S., Muller, D., Rotter, D., et al.: Global routing with timing constraints. IEEE Trans. Comput. Aided Des. Integrated Circuits Syst. 37(2), 406–419 (2018)
Siddiqi, U.F., Sait, S.M.: a game theory based post-processing method to enhance VLSI global routers. IEEE Access 5, 1328–1339 (2017)
Coulston, C.S.: Constructing exact octagonal steiner minimal trees. In: Proceedings of the 13th ACM Great Lakes symposium on VLSI, pp. 1–6. ACM (2003)
Chiang, C., Chiang, C.S.: Octilinear Steiner tree construction. In: The 2002 45th Midwest Symposium on Circuits and Systems, vol. 1, pp. 1–603 (2002)
Zhu, Q., Zhou, H., Jing, T., et al.: Spanning graph-based nonrectilinear steiner tree algorithms. IEEE Trans. Comput. Aided Des. Integrated Circuits Syst. 24(7), 1066–1075 (2006)
Liu, G.G., Chen, G.L., Guo, W.Z.: DPSO based octagonal steiner tree algorithm for VLSI routing. In: Proceeding of the 5th International Conference on Advanced Computational Intelligence (ICACI2012), pp. 383–387 (2012)
Liu, G.G., Huang, X., Guo, W.Z., et al.: Multilayer obstacle-avoiding X-architecture Steiner minimal tree construction based on particle swarm optimization. IEEE Trans. Cybern. 45(5), 989–1002 (2015)
Liu, G.G., Guo, W.Z., Niu, Y.Z., et al.: A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reduction. Soft. Comput. 19(5), 1153–1169 (2015)
Storn, R., Price, K.: Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341–359 (1997)
Zhou, Y.Z., Yi, W.C., Gao, L., et al.: Adaptive differential evolution with sorting crossover rate for continuous optimization problems. IEEE Trans. Cybern. 47(9), 2742–2753 (2017)
Qiu, X., Xu, J.X., Xu, Y., et al.: A new differential evolution algorithm for minimax optimization in robust design. IEEE Trans. Cybern. 48(5), 1355–1368 (2018)
Yong, W., Hao, L., Long, H., et al.: Differential evolution with a new encoding mechanism for optimizing wind farm layout. IEEE Trans. Ind. Inf. 14(3), 1040–1054 (2018)
Ge, Y.F., Yu, W.J., Lin, Y., et al.: Distributed differential evolution based on adaptive mergence and split for large-scale optimization. IEEE Trans. Cybern. 48(7), 2166–2180 (2018)
Zhou, X.G., Zhang, G.J.: Differential evolution with underestimation-based multimutation strategy. IEEE Trans. Cybern. 49(4), 1353–1364 (2019)
Wang, J., Liang, G., Zhang, J.: Cooperative differential evolution framework for constrained multiobjective optimization. IEEE Trans. Cybern. 49(6), 2060–2072 (2018)
Acknowledgements
This work was partially supported by the National Natural Science Foundation of China (Nos. 61877010 and 11501114), and the Fujian Natural Science Funds (No.2019J01243).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Wu, H., Xu, S., Zhuang, Z., Liu, G. (2020). X-Architecture Steiner Minimal Tree Construction Based on Discrete Differential Evolution. In: Liu, Y., Wang, L., Zhao, L., Yu, Z. (eds) Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery. ICNC-FSKD 2019. Advances in Intelligent Systems and Computing, vol 1074. Springer, Cham. https://doi.org/10.1007/978-3-030-32456-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-030-32456-8_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-32455-1
Online ISBN: 978-3-030-32456-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)