{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T15:25:40Z","timestamp":1772810740218,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,6,8]],"date-time":"2014-06-08T00:00:00Z","timestamp":1402185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s00500-014-1329-2","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T22:57:53Z","timestamp":1402441073000},"page":"1153-1169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":82,"title":["A PSO-based timing-driven Octilinear Steiner tree algorithm for\u00a0VLSI routing considering bend reduction"],"prefix":"10.1007","volume":"19","author":[{"given":"Genggeng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenzhong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhen","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guolong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,8]]},"reference":[{"key":"1329_CR1","unstructured":"Agrawal S, Silakari S (2013) FRPSO: Fletcher\u2013Reeves based particle swarm optimization for multimodal function optimization. Soft Comput 1\u201317"},{"key":"1329_CR2","volume-title":"Data structures and algorithms","author":"VA Alfred","year":"1983","unstructured":"Alfred VA, John EH, Jeffrey U (1983) Data structures and algorithms. Addison-Wesley Longman Publishing, Boston"},{"key":"1329_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: Swarm intelligence symposium, pp 137\u2013144","DOI":"10.1109\/SIS.2009.4937856"},{"key":"1329_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-36970-8_1","volume-title":"Proceedings of the 2nd international conference on evolutionary multi-criterion optimization","author":"R Balling","year":"2003","unstructured":"Balling R (2003) The maximin fitness function: multiobjective city and regional planning. Proceedings of the 2nd international conference on evolutionary multi-criterion optimization. Faro, Portugal, pp 1\u201315"},{"issue":"11","key":"1329_CR5","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic Mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"1329_CR6","doi-asserted-by":"crossref","unstructured":"Boese KD, Kahng AB, Robins G (1993) Near optimal critical sink routing tree constructions. In: Proceedings of the ACM\/IEEE design automation conference, pp 182\u2013187","DOI":"10.1145\/157485.164662"},{"issue":"12","key":"1329_CR7","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1109\/43.331412","volume":"13","author":"M Borah","year":"1994","unstructured":"Borah M, Owens RM, Irwin MJ (1994) An edge-based heuristic for Steiner routing. IEEE Trans Comput Aided Design 13(12):1563\u20131568","journal-title":"IEEE Trans Comput Aided Design"},{"issue":"5","key":"1329_CR8","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1109\/TCAD.2003.810747","volume":"22","author":"E Bozorgzadeh","year":"2003","unstructured":"Bozorgzadeh E, Kastner R, Sarrafzadeh M (2003) Creating and exploiting flexibility in rectilinear Steiner trees. IEEE Trans Comput Aided Design 22(5):605\u2013615","journal-title":"IEEE Trans Comput Aided Design"},{"issue":"3","key":"1329_CR9","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"ACC Carlos","year":"2004","unstructured":"Carlos ACC, Gregorio TP, Maximino SL (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 8(3):256\u2013279","journal-title":"IEEE Trans Evol Comput"},{"issue":"12","key":"1329_CR10","doi-asserted-by":"crossref","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":"1329_CR11","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":"1","key":"1329_CR12","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/TCAD.2007.907068","volume":"27","author":"C Chu","year":"2008","unstructured":"Chu C, Wong YC (2008) FLUTE: fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design. IEEE Trans Comput Aided Design 27(1):70\u201383","journal-title":"IEEE Trans Comput Aided Design"},{"key":"1329_CR13","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-39930-8_8","volume-title":"New optimization techniques in engineering","author":"M Clerc","year":"2004","unstructured":"Clerc M (2004) Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: Onwubolu GC, Babu BV (eds) New optimization techniques in engineering. Springer, Berlin, pp 219\u2013239"},{"key":"1329_CR14","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1109\/43.137519","volume":"11","author":"J Cong","year":"1992","unstructured":"Cong J, Kahng AB, Robins G, Sarrafzadeh M, Wong CK (1992) Provably good performance-driven global routing. IEEE Trans Comput Aided Design 11:739\u2013752","journal-title":"IEEE Trans Comput Aided Design"},{"key":"1329_CR15","volume-title":"Practical nonparametric statistics","author":"WJ Conover","year":"1999","unstructured":"Conover WJ (1999) Practical nonparametric statistics. Wiley, New York"},{"issue":"8","key":"1329_CR16","doi-asserted-by":"crossref","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":"1329_CR17","doi-asserted-by":"crossref","unstructured":"Coulston G (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":"1329_CR18","doi-asserted-by":"crossref","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, Nagoya, pp 39\u201343","DOI":"10.1109\/MHS.1995.494215"},{"key":"1329_CR19","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M Garey","year":"1997","unstructured":"Garey M, Johnson D (1997) The rectilinear steiner tree problem is NP-complete. SIAM J Appl Math 32:826\u2013834","journal-title":"SIAM J Appl Math"},{"key":"1329_CR20","doi-asserted-by":"crossref","unstructured":"Guo W, Park JH, Yang LT, Vasilakos AV, Xiong N, Chen G (2011) Design and analysis of a MST-based topology control scheme with PSO for wireless sensor networks. 2011 IEEE Asia-Pacific services computing conference. IEEE, Jeju Island, pp 360\u2013367","DOI":"10.1109\/APSCC.2011.20"},{"issue":"1","key":"1329_CR21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1504\/IJSNET.2012.047720","volume":"12","author":"W Guo","year":"2012","unstructured":"Guo W, Xiong N, Vasilakos AV, Chen G, Yu C (2012) Distributed k-connected fault-tolerant topology control algorithms with PSO in future autonomic sensor systems. Int J Sens Netw 12(1):53\u201362","journal-title":"Int J Sens Netw"},{"key":"1329_CR22","doi-asserted-by":"crossref","unstructured":"Julstrom BA (2001) Encoding rectilinear Steiner trees as lists of edges. In: Proceeding of the 2001 ACM symposium on applied computing, New York, pp 356\u2013360","DOI":"10.1145\/372202.372365"},{"key":"1329_CR23","volume-title":"Full-chip nanometer routing techniques","author":"TY Ho","year":"2007","unstructured":"Ho TY, Chang YW, Chen SJ (2007) Full-chip nanometer routing techniques. Springer, Berlin"},{"issue":"4","key":"1329_CR24","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/43.752927","volume":"18","author":"H Hou","year":"1999","unstructured":"Hou H, Hu J, Sapatnekar SS (1999) Non-hanan routing. IEEE Trans Comput Aided Des 18(4):436\u2013444","journal-title":"IEEE Trans Comput Aided Des"},{"issue":"1","key":"1329_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-9260(01)00020-7","volume":"31","author":"J Hu","year":"2001","unstructured":"Hu J, Sapatnekar S (2001) A survey on multi-net global routing for integrated circuits. Inter VLSI J 31(1):1\u201349","journal-title":"Inter VLSI J"},{"key":"1329_CR26","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of the world multiconference on systemics, cybernetics and informatics, Piscataway, pp 4104\u20134109","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"1329_CR27","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"},{"issue":"3","key":"1329_CR28","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1162\/106365602760234108","volume":"10","author":"M Laumanns","year":"2002","unstructured":"Laumanns M, Thiele L, Deb K, Zitzler E (2002) Combining convergence and diversity in evolutionary multi-objective optimization. Evol Comput 10(3):263\u2013282","journal-title":"Evol Comput"},{"key":"1329_CR29","unstructured":"Liang J, Hong X, Jing T (2007) G-Tree: gravitation-direction-based rectilinear Steiner minimal tree construction considering bend reduction. Proceedings of the 7th international conference on ASIC. IEEE, Guilin, pp 1114\u20131117"},{"key":"1329_CR30","doi-asserted-by":"crossref","unstructured":"Liu G, Chen G, Guo W (2012) DPSO based octagonal steiner tree algorithm for VLSI routing. 2012 IEEE fifth international conference on advanced computational intellligence. IEEE, Nanjing, pp 383\u2013387","DOI":"10.1109\/ICACI.2012.6463191"},{"key":"1329_CR31","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"},{"issue":"2","key":"1329_CR32","doi-asserted-by":"crossref","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"},{"key":"1329_CR33","unstructured":"Pan QK, Tasgetiren MF, Liang YC (2006) A discrete particle swarm optimization algorithm for the permutation flowshop sequecing problem with makespan criteria. In: Proceedings of the 26th SGAI international conference on innovative techniques and applications of artificial intelligence, Cambridge, pp 19\u201331"},{"key":"1329_CR34","doi-asserted-by":"crossref","unstructured":"Peng S, Chen G, Guo W (2010) A multi-objective algorithm based on discrete PSO for VLSI partitioning problem. In: Proceedings of the 2nd international conference on quantitative logic and soft computing, Jimei, pp 651\u2013660","DOI":"10.1007\/978-3-642-15660-1_66"},{"issue":"6","key":"1329_CR35","doi-asserted-by":"crossref","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":"1329_CR36","doi-asserted-by":"crossref","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"},{"key":"1329_CR37","unstructured":"Samanta T, Ghosal P, Rahaman H, Dasgupta PS (2006) A heuristic methiod for constructing hexagonal steiner minimal trees for routing in VLSI. In: 2006 IEEE international symposium on circuits and systems, pp 1788\u20131791"},{"issue":"1","key":"1329_CR38","doi-asserted-by":"crossref","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 Digital Tech 5(1):36\u201348","journal-title":"IET Comput Digital Tech"},{"issue":"1","key":"1329_CR39","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/43.273751","volume":"13","author":"M Sarrafzadeh","year":"1994","unstructured":"Sarrafzadeh M, Feng LK, Wong CK (1994) Single-layer global routing. IEEE Trans Comput Aided Design 13(1):38\u201347","journal-title":"IEEE Trans Comput Aided Design"},{"key":"1329_CR40","unstructured":"Seo DY, Lee DT (1999) On the complexity of bicriteria spanning tree problems for a set of points in the plane. PhD Dissertation, Northwestern University"},{"key":"1329_CR41","doi-asserted-by":"crossref","unstructured":"Shen Y, Liu Q, Guo W (2011) Obstacle-avoiding rectilinear steiner minimum tree construction based on discrete particle swarm optimization. In: Proceedings of the 2011 seventh international conference on natural computation, pp 2179\u20132183","DOI":"10.1109\/ICNC.2011.6022440"},{"key":"1329_CR42","unstructured":"Shi YH, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of the IEEE international conference of evolutionary computation, Piscataway, pp 69\u201373"},{"issue":"2","key":"1329_CR43","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"1329_CR44","doi-asserted-by":"crossref","unstructured":"Teig S (2002) The X architecture: not your fathers diagonal wiring. In: Proceedings of the ACM international workshop system level interconnect prediction, pp 33\u201337","DOI":"10.1145\/505348.505355"},{"key":"1329_CR45","series-title":"Advances in Steiner Trees","volume-title":"Exact algorithms for plane steiner tree problems: a computational study","author":"DM Warme","year":"1998","unstructured":"Warme DM, Winter P, Zachariasen M (1998) Exact algorithms for plane steiner tree problems: a computational study., Advances in Steiner TreesKluwer Academic Publishers, Dordrecht"},{"issue":"2","key":"1329_CR46","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1049\/ip-cdt:20050186","volume":"153","author":"JT Yan","year":"2006","unstructured":"Yan JT (2006) Dynamic tree reconstruction with application to timing-constrained congestion-driven global routing. IEE Proc Comput Digital Tech 153(2):117\u2013129","journal-title":"IEE Proc Comput Digital Tech"},{"issue":"2","key":"1329_CR47","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 Design Autom Electron Syst 13(2):26","journal-title":"ACM Trans Design Autom Electron Syst"},{"key":"1329_CR48","unstructured":"Yehea II, Eby GF, Jose LN (1999) Equivalent elmore delay for RLC trees. In: Proceedings of the 36th design automation conference, pp 715\u2013720"},{"issue":"7","key":"1329_CR49","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1109\/TCAD.2005.850862","volume":"24","author":"Q Zhu","year":"2005","unstructured":"Zhu Q, Zhou H, Jing T, Hong X, Yang Y (2005) Spanning graph-based nonrectilinear steiner tree algorithms. IEEE Trans Comput Aided Design 24(7):1066\u20131075","journal-title":"IEEE Trans Comput Aided Design"},{"key":"1329_CR50","unstructured":"Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: methods and applications. Swiss Federal Institute of Technology, Zurich"},{"key":"1329_CR51","unstructured":"Zitzler E, Laumanns M, and Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm. In: Giannakoglou KC, Tsahalis DT, Periaux J, Papailiou KD, Fogarty T (eds) Evolutionary methods for design optimization and control with applications to industrial problems. International Center for Numerical Methods in Engineering, pp 95\u2013100"},{"key":"1329_CR52","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler E, Thiele L, Laumanns M et al (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7:117\u2013132","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1329-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1329-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1329-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T11:57:44Z","timestamp":1565524664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1329-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,8]]},"references-count":52,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["1329"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1329-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,8]]}}}