{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T18:45:52Z","timestamp":1770489952870,"version":"3.49.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T00:00:00Z","timestamp":1561161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T00:00:00Z","timestamp":1561161600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501114"],"award-info":[{"award-number":["11501114"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00500-019-04165-2","type":"journal-article","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T16:02:17Z","timestamp":1561219337000},"page":"3943-3961","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":78,"title":["A unified algorithm based on HTS and self-adapting PSO for the construction of octagonal and rectilinear SMT"],"prefix":"10.1007","volume":"24","author":[{"given":"Genggeng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zhisheng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Zhuang","sequence":"additional","affiliation":[]},{"given":"Wenzhong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Guolong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,22]]},"reference":[{"issue":"11","key":"4165_CR1","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1007\/s00500-013-1196-2","volume":"18","author":"S Agrawal","year":"2014","unstructured":"Agrawal S, Silakari S (2014) FRPSO: Fletcher-Reeves based particle swarm optimization for multimodal function optimization. Soft Comput 18(11):2227\u20132243","journal-title":"Soft Comput"},{"key":"4165_CR2","doi-asserted-by":"crossref","unstructured":"Alpert CJ (1998) The ISPD98 circuit benchmark suite. In: Proceedings of the 1998 international symposium on Physical design, pp 80\u201385","DOI":"10.1145\/274535.274546"},{"key":"4165_CR3","doi-asserted-by":"crossref","unstructured":"Arora T, Mose ME (2009) Ant colony optimization for power efficient routing in manhattan and non-manhattan VLSI architectures. In: Proceedings of the Swarm intelligence symposium, pp 137\u2013144","DOI":"10.1109\/SIS.2009.4937856"},{"key":"4165_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-07350-7_21","volume-title":"Advanced Computing, Networking and Informatics- Volume 2","author":"Pallabi Bhattacharya","year":"2014","unstructured":"Bhattacharya P, Khan A, Sarkar, SK (2014) A global routing optimization scheme based on ABC algorithm. In: Proceedings of the 2nd international conference on advanced computing, networking and informatics, pp 189\u2013197"},{"issue":"12","key":"4165_CR5","doi-asserted-by":"publisher","first-page":"1931","DOI":"10.1109\/TCAD.2010.2061590","volume":"29","author":"YJ Chang","year":"2010","unstructured":"Chang YJ, Lee YT, Gao JR, Wu PC, Wang TC (2010) NTHU-Route. 20: a robust global router for modern designs. IEEE Trans Comput Aid Des 29(12):1931\u20131944","journal-title":"IEEE Trans Comput Aid Des"},{"issue":"12","key":"4165_CR6","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1007\/s00500-009-0501-6","volume":"14","author":"G Chen","year":"2010","unstructured":"Chen G, Guo W, Chen Y (2010) A PSO-based intelligent decision algorithm for VLSI floorplanning. Soft Comput 14(12):1329\u20131337","journal-title":"Soft Comput"},{"key":"4165_CR7","doi-asserted-by":"crossref","unstructured":"Chiang C, Chiang CS (2002) Octilinear steiner tree construction. In: Proceedings of the 45th midwest symposium on circuits and systems, pp 603\u2013606","DOI":"10.1109\/MWSCAS.2002.1187293"},{"issue":"8","key":"4165_CR8","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1007\/s00500-012-0841-5","volume":"16","author":"V Costas","year":"2012","unstructured":"Costas V, Konstantinos E, Isaac E (2012) Particle swarm optimization with deliberate loss of information. Soft Comput 16(8):1373\u20131392","journal-title":"Soft Comput"},{"key":"4165_CR9","doi-asserted-by":"crossref","unstructured":"Coulston CS (2003) Constructing exact octagonal steiner minimal trees. In: Proceedings of the 13th ACM Great Lakes symposium on VLSI, pp 1\u20136","DOI":"10.1145\/764808.764810"},{"key":"4165_CR10","unstructured":"Dai KR, Liu WH, Li YL (2009) Efficient simulated evolution based rerouting and congestion-relaxed layer assignment on 3-D global routing. In: Proceedings of Asia and South Pacific Design Automation Conference, pp 570V575"},{"issue":"3","key":"4165_CR11","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/TVLSI.2010.2102780","volume":"20","author":"KR Dai","year":"2012","unstructured":"Dai KR, Liu WH, Li YL (2012) NCTU-GR: Efficient simulated evolution-based rerouting and congestion-relaxed layer assignment on 3-D global routing. IEEE Trans VLSI Syst 20(3):459\u2013472","journal-title":"IEEE Trans VLSI Syst"},{"key":"4165_CR12","unstructured":"Eberhar RC, Kennedy J (1995) A new optimizer using particles swarm theory. In: Proceedings of the 6th international symposium on micro machine and human science, pp 39\u201343"},{"key":"4165_CR13","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M Garey","year":"1977","unstructured":"Garey M, Johnson D (1977) The rectilinear steiner tree problem is NP-complete. SIAM J Appl Math 32:826\u2013834","journal-title":"SIAM J Appl Math"},{"key":"4165_CR14","unstructured":"Gottlieb J, Julstrom BA, Raidl GR, Rothlauf F (2001) Prufer Numbers: a poor representation of spanning trees for evolutionary search. In: Proceedings of the genetic and evolutionary computation conference, pp 343\u2013350"},{"issue":"2","key":"4165_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s11704-014-3008-y","volume":"8","author":"WZ Guo","year":"2014","unstructured":"Guo WZ, Liu GG, Chen GL, Peng SJ (2014) A hybrid multi- objective PSO algorithm with local search strategy for VLSI partitioning. Front Comput Sci 8(2):203\u2013216","journal-title":"Front Comput Sci"},{"issue":"1","key":"4165_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1109\/TVLSI.2012.2234489","volume":"22","author":"Y Han","year":"2014","unstructured":"Han Y, Ancajas DM, Chakraborty K, Roy S (2014) Exploring high-throughput computing paradigm for global routing. IEEE Trans VLSI Syst 22(1):155\u2013167","journal-title":"IEEE Trans VLSI Syst"},{"key":"4165_CR17","unstructured":"Held S, Muller D, Rotter D, Scheifele R, Traub V, Vygen J (2017) Global routing with timing constraints. IEEE Trans Comput Aid Des 1\u201317"},{"key":"4165_CR18","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press, Cambridge"},{"issue":"3","key":"4165_CR19","first-page":"1","volume":"21","author":"X Huang","year":"2016","unstructured":"Huang X, Guo W, Liu G, Chen G (2016) FH-OAOS: a fast four-step heuristic for obstacle-avoiding octilinear steiner tree construction. ACM Trans Des Automat Elec 21(3):1\u201331","journal-title":"ACM Trans Des Automat Elec"},{"issue":"1","key":"4165_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11431-016-0270-x","volume":"60","author":"X Huang","year":"2017","unstructured":"Huang X, Guo W, Liu G, Chen G (2017) MLXR: multi- layer obstacle-avoiding X-architecture steiner tree construction for VLSI routing. Sci China Inform Sci 60(1):1\u20133","journal-title":"Sci China Inform Sci"},{"key":"4165_CR21","doi-asserted-by":"crossref","unstructured":"Khan A, Laha S, Sarkar SK (2013) A novel particle swarm optimization approach for VLSI routing. In: Proceedings of advance computing conference, pp 258\u2013262","DOI":"10.1109\/IAdCC.2013.6514231"},{"key":"4165_CR22","unstructured":"Koh CK, Madden PH (2000) Manhattan or non-manhattan? a study of alternative VLSI routing architectures. In: Proceedings of Great Lake symposium on VLSI, pp 47\u201352"},{"key":"4165_CR23","doi-asserted-by":"crossref","unstructured":"Kundu S, Roy S, Mukherjee S (2016) SAT based rectilinear steiner tree construction. In: Proceedings of Appl. Theor Comput Commun Tech, pp 623\u2013627","DOI":"10.1109\/ICATCCT.2016.7912075"},{"key":"4165_CR24","doi-asserted-by":"crossref","unstructured":"Kundu S, Roy S, Mukherjee S (2017) K-nearest neighbour (KNN) approach using SAT based technique for rectilinear steiner tree construction. In: Proceedings of embedded computer systems design, pp 1\u20135","DOI":"10.1109\/ISED.2017.8303915"},{"key":"4165_CR25","doi-asserted-by":"crossref","unstructured":"Liu G, Chen G, Guo W, Chen Z (2011) DPSO-based rectilinear steiner minimal tree construction considering bend reduction. In: Proceedings of the 7th international conference on natural computation, pp 1161\u20131165","DOI":"10.1109\/ICNC.2011.6022221"},{"key":"4165_CR26","doi-asserted-by":"crossref","unstructured":"Liu G, Chen G, Guo W (2012) DPSO based octagonal steiner tree algorithm for VLSI routing. In: Proceedings of the 5th international conference on advanced computational intellligence, pp 383\u2013387","DOI":"10.1109\/ICACI.2012.6463191"},{"issue":"4","key":"4165_CR27","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/s11704-015-4017-1","volume":"9","author":"G Liu","year":"2015","unstructured":"Liu G, Guo W, Li R, Niu Y, Chen G (2015) XGRouter: high-quality global router in X-architecture with particle swarm optimization. Front Comput Sci 9(4):576\u2013594","journal-title":"Front Comput Sci"},{"issue":"5","key":"4165_CR28","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1007\/s00500-014-1329-2","volume":"19","author":"G Liu","year":"2015","unstructured":"Liu G, Guo W, Niu Y, Chen G, Huang X (2015) A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reduction. Soft Comput 19(5):1153\u20131169","journal-title":"Soft Comput"},{"issue":"5","key":"4165_CR29","first-page":"989","volume":"45","author":"G Liu","year":"2015","unstructured":"Liu G, Huang X, Guo W, Niu Y, Chen G (2015) Multilayer obstacle-avoiding X-architecture steiner minimal tree construction based on particle swarm optimization. IEEE Trans Cybern 45(5):989\u20131002","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"4165_CR30","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.asoc.2009.08.031","volume":"10","author":"H Liu","year":"2010","unstructured":"Liu H, Cai Z, Wang Y (2010) Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 10(2):629\u2013640","journal-title":"Appl Soft Comput"},{"issue":"5","key":"4165_CR31","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TCAD.2012.2235124","volume":"32","author":"W Liu","year":"2013","unstructured":"Liu W, Kao W, Li Y, Chao K (2013) NCTU-GR 2.0: multithreaded collision-aware global routing with bounded-length maze routing. IEEE Trans Comput Aid Des 32(5):709\u2013722","journal-title":"IEEE Trans Comput Aid Des"},{"key":"4165_CR32","doi-asserted-by":"crossref","unstructured":"Lv H, Zheng J, Zhou C, Zhou, C, Li K (2009) The convergence analysis of genetic algorithm based on space mating. In: Proceeding of the 5th international conference on natural computation, pp 557\u2013562","DOI":"10.1109\/ICNC.2009.39"},{"issue":"2","key":"4165_CR33","first-page":"260","volume":"11","author":"J Ma","year":"2000","unstructured":"Ma J, Yang B, Ma SH (2000) A near-optimal approximation algorithm for Manhattan Steiner Tree. J Soft 11(2):260\u2013264 (in Chinese)","journal-title":"J Soft"},{"key":"4165_CR34","doi-asserted-by":"crossref","unstructured":"Manna S, Chakrabarti T, Sharma U, Sarkar SK (2015) Efficient VLSI routing optimization employing discrete differential evolution technique. In: Proceedings of Recent Trends in Information Systems, pp 461\u2013464","DOI":"10.1109\/ReTIS.2015.7232923"},{"key":"4165_CR35","unstructured":"Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurr Comput Progr C3P Rep 826: 1989"},{"key":"4165_CR36","first-page":"139","volume-title":"Lecture Notes in Computer Science","author":"Chisato Numaoka","year":"1996","unstructured":"Numaoka C (1996) Bacterial evolution algorithm for rapid adaptation. In: Proceedings of European workshop on modelling autonomous agents in a multi-agent world, pp 139\u2013148"},{"issue":"6","key":"4165_CR37","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1007\/s00500-013-1015-9","volume":"17","author":"J Rada-Vilela","year":"2013","unstructured":"Rada-Vilela J, Zhang M, Seah W (2013) A performance study on synchronicity and neighborhood size in particle swarm optimization. Soft Comput 17(6):1019\u20131030","journal-title":"Soft Comput"},{"issue":"3","key":"4165_CR38","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TEVC.2004.826071","volume":"8","author":"A Ratnaweera","year":"2004","unstructured":"Ratnaweera A, Halgamuge SK, Watson HC (2004) Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans Evol Comput 8(3):240\u2013255","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"4165_CR39","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/72.265964","volume":"5","author":"G Rudolph","year":"1994","unstructured":"Rudolph G (1994) Convergence analysis of canonical genetic algorithms. IEEE Trans Neural Network 5(1):96\u2013101","journal-title":"IEEE Trans Neural Network"},{"issue":"6","key":"4165_CR40","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1109\/TSMCB.2012.2228188","volume":"43","author":"R Ruiz-Cruz","year":"2013","unstructured":"Ruiz-Cruz R, Sanchez EN, Ornelas-Tellez F, Loukianov AG, Harley RG (2013) Particle swarm optimization for discrete-time inverse optimal control of a doubly fed induction generator. IEEE Trans Cybern 43(6):1698\u20131709","journal-title":"IEEE Trans Cybern"},{"key":"4165_CR41","unstructured":"Samanta T, Ghosal P, Rahaman H, Dasgupta PS (2006) A heuristic methiod for constructing hexagonal steiner minimal trees for routing in VLSI. In: IEEE international symposium on circuits and systems, pp 1788\u20131791"},{"issue":"1","key":"4165_CR42","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1049\/iet-cdt.2009.0074","volume":"5","author":"T Samanta","year":"2011","unstructured":"Samanta T, Rahaman H, Dasgupta PS (2011) Near-optimal Y-routed delay trees in nanometric interconnect design. IET Comput Digit Tec 5(1):36\u201348","journal-title":"IET Comput Digit Tec"},{"key":"4165_CR43","doi-asserted-by":"crossref","unstructured":"Scheifele R (2016) RC-aware global routing. In: IEEE\/ACM international conference on computer-aided design, pp 1\u20138","DOI":"10.1145\/2966986.2967067"},{"issue":"1","key":"4165_CR44","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s00453-016-0149-4","volume":"78","author":"R Scheifele","year":"2017","unstructured":"Scheifele R (2017) Steiner trees with bounded RC-delay. Alogithmica 78(1):86\u2013109","journal-title":"Alogithmica"},{"key":"4165_CR45","unstructured":"Shi YH, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of the IEEE international conference of evolutionary computation, pp 69\u201373"},{"key":"4165_CR46","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1109\/ACCESS.2017.2665601","volume":"5","author":"UF Siddiqi","year":"2017","unstructured":"Siddiqi UF, Sait SM (2017) A game theory based post-processing method to enhance VLSI global routers. IEEE Access 5:1328\u20131339","journal-title":"IEEE Access"},{"key":"4165_CR47","unstructured":"Thurber A, Xue G (1999) Computing hexagonal steiner trees using PCx for VLS. In: Proceedings of the 6th IEEE international conference on electronic, circuits, and system, pp 381\u2013384"},{"key":"4165_CR48","unstructured":"Wang D, Tan D, Liu L (2017) Particle swarm optimization algorithm: an overview. Soft Comput 1\u201322"},{"key":"4165_CR49","volume-title":"Very large scale integration physical design theory and method","author":"N Xu","year":"2009","unstructured":"Xu N, Hong XL (2009) Very large scale integration physical design theory and method. Tsinghua University Press, Tsinghua (in Chinese)"},{"key":"4165_CR50","unstructured":"Xu X, Rong H, Trovati M, Liptrott M, Bessis N (2016) CS-PSO: chaotic particle swarm optimization algorithm for solving combinatorial optimization problems. Soft Comput 1\u201313"},{"issue":"6","key":"4165_CR51","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1109\/TSMCB.2012.2227469","volume":"43","author":"B Xue","year":"2013","unstructured":"Xue B, Zhang MJ, Browne MN (2013) Particle swarm optimization for feature selection in classification: a multi-objective approach. IEEE Trans Cybern 43(6):1656\u20131671","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"4165_CR52","first-page":"26","volume":"13","author":"JT Yan","year":"2008","unstructured":"Yan JT (2008) Timing-driven octilinear steiner tree construction based on steiner-point reassignment and path reconstruction. ACM Trans Des Automat El 13(2):26","journal-title":"ACM Trans Des Automat El"},{"key":"4165_CR53","unstructured":"Zachariasen M (2003) GeoSteiner Homepage. Available: \nhttp:\/\/www.diku.dk\/geosteiner"},{"issue":"7","key":"4165_CR54","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1109\/TCAD.2005.850862","volume":"24","author":"Q Zhu","year":"2005","unstructured":"Zhu Q, Zhou H, Jing T, Hong XL, Yang Y (2005) Spanning graph-based nonrectilinear Steiner tree allgorithms. IEEE Trans Comput Aid Des 24(7):1066\u20131075","journal-title":"IEEE Trans Comput Aid Des"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04165-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04165-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04165-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T23:09:38Z","timestamp":1592694578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04165-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,22]]},"references-count":54,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["4165"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04165-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,22]]},"assertion":[{"value":"22 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All the authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}