{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T09:20:44Z","timestamp":1769160044876,"version":"3.49.0"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"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":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s00521-014-1760-4","type":"journal-article","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T05:11:28Z","timestamp":1414991488000},"page":"875-898","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Key-node-based local search discrete artificial bee colony algorithm for obstacle-avoiding rectilinear Steiner tree construction"],"prefix":"10.1007","volume":"26","author":[{"given":"Hao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Dong-Yi","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,1]]},"reference":[{"issue":"1","key":"1760_CR1","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0130013","volume":"30","author":"F Hwang","year":"1976","unstructured":"Hwang F (1976) On Steiner minimal trees with rectilinear distance. SIAM J Appl Math 30(1):104\u2013114. doi: 10.1137\/0130013","journal-title":"SIAM J Appl Math"},{"issue":"2","key":"1760_CR2","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TCAD.2010.2096571","volume":"30","author":"G Ajwani","year":"2011","unstructured":"Ajwani G, Chu C, Mak W-K (2011) FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction. IEEE Trans Comput Aid Des Integr Circ Syst 30(2):194\u2013204. doi: 10.1109\/TCAD.2010.2096571","journal-title":"IEEE Trans Comput Aid Des Integr Circ Syst"},{"issue":"7","key":"1760_CR3","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1109\/TCAD.2012.2185050","volume":"31","author":"C-H Liu","year":"2012","unstructured":"Liu C-H, Kuo S-Y, Lee DT, Lin C-S, Weng J-H, Yuan S-Y (2012) Obstacle-avoiding rectilinear steiner tree construction: a Steiner-point-based algorithm. IEEE Trans Comput Aid Des Integr Circ Syst 31(7):1050\u20131060. doi: 10.1109\/TCAD.2012.2185050","journal-title":"IEEE Trans Comput Aid Des Integr Circ Syst"},{"issue":"4","key":"1760_CR4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TCAD.2008.917583","volume":"27","author":"CW Lin","year":"2008","unstructured":"Lin CW, Chen S-Y, Chi-Feng L, Yao-Wen C, Chia-Lin Y (2008) Obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs. IEEE Trans Comput Aid Des Integr Circ Syst 27(4):643\u2013653. doi: 10.1109\/TCAD.2008.917583","journal-title":"IEEE Trans Comput Aid Des Integr Circ Syst"},{"key":"1760_CR5","unstructured":"Li L, Young EFY (2008) Obstacle-avoiding rectilinear Steiner tree construction. In Proceedings of the 2008 IEEE\/ACM international conference on computer-aided design, pp 523\u2013528"},{"issue":"12","key":"1760_CR6","doi-asserted-by":"crossref","first-page":"2169","DOI":"10.1109\/TCAD.2008.2006098","volume":"27","author":"J Long","year":"2008","unstructured":"Long J, Zhou H, Memik SO (2008) EBOARST: an efficient edge-based obstacle-avoiding rectilinear Steiner tree construction algorithm. IEEE Trans Comput Aid Des Integr Circ Syst 27(12):2169\u20132182. doi: 10.1109\/TCAD.2008.2006098","journal-title":"IEEE Trans Comput Aid Des Integr Circ Syst"},{"key":"1760_CR7","doi-asserted-by":"crossref","unstructured":"Ganley JL, Cohoon JP (1994) Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles. 1994 IEEE international symposium on circuits and systems, 1994 ISCAS \u201894, vol 1, pp 113\u2013116. doi: 10.1109\/ISCAS.1994.408768","DOI":"10.1109\/ISCAS.1994.408768"},{"key":"1760_CR8","doi-asserted-by":"crossref","unstructured":"Karp R (2010) Reducibility among combinatorial problems. In: J\u00fcnger M, Liebling TM, Naddef D et al (eds) 50 Years of integer programming 1958\u20132008. Springer, Berlin, pp 219\u2013241. doi: 10.1007\/978-3-540-68279-0_8","DOI":"10.1007\/978-3-540-68279-0_8"},{"issue":"24","key":"1760_CR9","first-page":"573","volume":"6","author":"H Takahashi","year":"1980","unstructured":"Takahashi H, Matsuyama A (1980) An approximate solution for the Steiner problem in graphs. Math Jpn 6(24):573\u2013577","journal-title":"Math Jpn"},{"issue":"2","key":"1760_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L Kou","year":"1981","unstructured":"Kou L, Markowsky G, Berman L (1981) A fast algorithm for Steiner trees. Acta Informatica 15(2):141\u2013145. doi: 10.1007\/BF00288961","journal-title":"Acta Informatica"},{"issue":"2","key":"1760_CR11","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10732-012-9198-2","volume":"19","author":"R Qu","year":"2013","unstructured":"Qu R, Xu Y, Castro J, Landa-Silva D (2013) Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems. J Heuristics 19(2):317\u2013342. doi: 10.1007\/s10732-012-9198-2","journal-title":"J Heuristics"},{"issue":"4","key":"1760_CR12","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/4235.738982","volume":"2","author":"Y Leung","year":"1998","unstructured":"Leung Y, Li G, Xu Z-B (1998) A genetic algorithm for the multiple destination routing problems. IEEE Trans Evol Comput 2(4):150\u2013161. doi: 10.1109\/4235.738982","journal-title":"IEEE Trans Evol Comput"},{"key":"1760_CR13","doi-asserted-by":"crossref","unstructured":"Wen-Liang Z, Jian H, Jun Z (2008) A novel particle swarm optimization for the Steiner tree problem in graphs.\u00a02008 IEEE congress on evolutionary computation, pp 2460\u20132467. doi: 10.1109\/CEC.2008.4631127","DOI":"10.1109\/CEC.2008.4631127"},{"issue":"1","key":"1760_CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s11235-006-8202-2","volume":"32","author":"N Skorin-Kapov","year":"2006","unstructured":"Skorin-Kapov N, Kos M (2006) A GRASP heuristic for the delay-constrained multicast routing problem. Telecommun Syst 32(1):55\u201369. doi: 10.1007\/s11235-006-8202-2","journal-title":"Telecommun Syst"},{"issue":"2","key":"1760_CR15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/(SICI)1097-0037(199703)29:2<89::AID-NET3>3.0.CO;2-7","volume":"29","author":"C Duin","year":"1997","unstructured":"Duin C, Vo\u03b2 S (1997) Efficient path and vertex exchange in steiner tree algorithms. Networks 29(2):89\u2013105. doi: 10.1002\/(SICI)1097-0037(199703)29:2<89:AID-NET3>3.0.CO;2-7","journal-title":"Networks"},{"issue":"2","key":"1760_CR16","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1002\/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-U","volume":"36","author":"CC Ribeiro","year":"2000","unstructured":"Ribeiro CC, De Souza MC (2000) Tabu search for the Steiner problem in graphs. Networks 36(2):138\u2013146. doi: 10.1002\/1097-0037(200009)36:2<138:AID-NET9>3.0.CO;2-U","journal-title":"Networks"},{"key":"1760_CR17","unstructured":"MP de Aragao CR, E Uchoa, RF Werneck (2001) Hybrid local search for the steiner problem in graphs. In extended abstracts of the 4th metaheuristics international conference, pp 429\u2013433"},{"issue":"1","key":"1760_CR18","doi-asserted-by":"crossref","first-page":"2.1","DOI":"10.1145\/2133803.2184448","volume":"17","author":"E Uchoa","year":"2012","unstructured":"Uchoa E, Werneck RF (2012) Fast local search for the steiner problem in graphs. J Exp Algorithm 17(1):2.1\u20132.22. doi: 10.1145\/2133803.2184448","journal-title":"J Exp Algorithm"},{"key":"1760_CR19","unstructured":"Zhenhua Z, Hua W, Lin Y (2012) An Artificial Bee Colony Optimization algorithm for multicast routing. 2012 14th International conference on advanced communication technology (ICACT), pp 168\u2013172"},{"key":"1760_CR20","unstructured":"Karaboga. D (2005) An idea based on honey bee swarm for numerical optimization. Technical report-TR06. Erciyes University, Engineering Faculty, Computer Engineering Department"},{"issue":"1","key":"1760_CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42(1):21\u201357. doi: 10.1007\/s10462-012-9328-0","journal-title":"Artif Intell Rev"},{"issue":"3","key":"1760_CR22","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459\u2013471. doi: 10.1007\/s10898-007-9149-x","journal-title":"J Glob Optim"},{"issue":"1","key":"1760_CR23","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687\u2013697. doi: 10.1016\/j.asoc.2007.05.007","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1760_CR24","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108\u2013132. doi: 10.1016\/j.amc.2009.03.090","journal-title":"Appl Math Comput"},{"issue":"10","key":"1760_CR25","doi-asserted-by":"crossref","first-page":"1939","DOI":"10.1007\/s00500-013-1029-3","volume":"17","author":"T Sharma","year":"2013","unstructured":"Sharma T, Pant M (2013) Enhancing the food locations in an artificial bee colony algorithm. Soft Comput 17(10):1939\u20131965. doi: 10.1007\/s00500-013-1029-3","journal-title":"Soft Comput"},{"issue":"1","key":"1760_CR26","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.asoc.2011.08.040","volume":"12","author":"G Li","year":"2012","unstructured":"Li G, Niu P, Xiao X (2012) Development and investigation of efficient artificial bee colony algorithm for numerical function optimization. Appl Soft Comput 12(1):320\u2013332. doi: 10.1016\/j.asoc.2011.08.040","journal-title":"Appl Soft Comput"},{"issue":"3","key":"1760_CR27","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.cor.2011.06.007","volume":"39","author":"Gao W-f","year":"2012","unstructured":"W-f Gao, S-y Liu (2012) A modified artificial bee colony algorithm. Comput Oper Res 39(3):687\u2013697. doi: 10.1016\/j.cor.2011.06.007","journal-title":"Comput Oper Res"},{"issue":"1\u20134","key":"1760_CR28","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s00170-011-3610-1","volume":"60","author":"L Wang","year":"2012","unstructured":"Wang L, Zhou G, Xu Y, Wang S, Liu M (2012) An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int J Adv Manuf Technol 60(1\u20134):303\u2013315. doi: 10.1007\/s00170-011-3610-1","journal-title":"Int J Adv Manuf Technol"},{"issue":"9\u201312","key":"1760_CR29","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1007\/s00170-012-4463-y","volume":"66","author":"D Lei","year":"2013","unstructured":"Lei D (2013) Multi-objective artificial bee colony for interval job shop scheduling with flexible maintenance. Int J Adv Manuf Technol 66(9\u201312):1835\u20131843. doi: 10.1007\/s00170-012-4463-y","journal-title":"Int J Adv Manuf Technol"},{"key":"1760_CR30","doi-asserted-by":"crossref","unstructured":"Han Y-Y, Liang JJ, Pan Q-K, Li J-Q, Sang H-Y, Cao NN (2012) Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem. Int J Adv Manuf Technol 1\u201318. doi: 10.1007\/s00170-012-4493-5","DOI":"10.1007\/s00170-012-4493-5"},{"issue":"10\u201311","key":"1760_CR31","doi-asserted-by":"crossref","first-page":"6758","DOI":"10.1016\/j.apm.2013.02.011","volume":"37","author":"MF Tasgetiren","year":"2013","unstructured":"Tasgetiren MF, Pan Q-K, Suganthan PN, Oner A (2013) A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Appl Math Model 37(10\u201311):6758\u20136779. doi: 10.1016\/j.apm.2013.02.011","journal-title":"Appl Math Model"},{"key":"1760_CR32","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.omega.2013.12.004","volume":"45","author":"Q-K Pan","year":"2014","unstructured":"Pan Q-K, Wang L, Li J-Q, Duan J-H (2014) A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega 45:42\u201356. doi: 10.1016\/j.omega.2013.12.004","journal-title":"Omega"},{"key":"1760_CR33","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.engappai.2013.12.009","volume":"29","author":"A Rajasekhar","year":"2014","unstructured":"Rajasekhar A, Kumar Jatoth R, Abraham A (2014) Design of intelligent PID\/PI\u03bbD\u03bc speed controller for chopper fed DC motor drive using opposition based artificial bee colony algorithm. Eng Appl Artif Intell 29:13\u201332. doi: 10.1016\/j.engappai.2013.12.009","journal-title":"Eng Appl Artif Intell"},{"issue":"3","key":"1760_CR34","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1080\/0305215X.2013.776551","volume":"46","author":"MK Apalak","year":"2014","unstructured":"Apalak MK, Karaboga D, Akay B (2014) The artificial bee colony algorithm in layer optimization for the maximum fundamental frequency of symmetrical laminated composite plates. Engineering Optimization 46(3):420\u2013437. doi: 10.1080\/0305215X.2013.776551","journal-title":"Engineering Optimization"},{"key":"1760_CR35","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.ins.2014.05.033","volume":"281","author":"D Bose","year":"2014","unstructured":"Bose D, Biswas S, Vasilakos AV, Laha S (2014) Optimal filter design using an improved artificial bee colony algorithm. Inf Sci 281:443\u2013461. doi: 10.1016\/j.ins.2014.05.033","journal-title":"Inf Sci"},{"issue":"1","key":"1760_CR36","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.asoc.2011.08.038","volume":"12","author":"MH Kashan","year":"2012","unstructured":"Kashan MH, Nahavandi N, Kashan AH (2012) DisABC: a new artificial bee colony algorithm for binary optimization. Appl Soft Comput 12(1):342\u2013352. doi: 10.1016\/j.asoc.2011.08.038","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1760_CR37","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1016\/j.asoc.2009.12.025","volume":"11","author":"D Karaboga","year":"2011","unstructured":"Karaboga D, Ozturk C (2011) A novel clustering approach: artificial Bee Colony (ABC) algorithm. Appl Soft Comput 11(1):652\u2013657. doi: 10.1016\/j.asoc.2009.12.025","journal-title":"Appl Soft Comput"},{"issue":"7","key":"1760_CR38","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1007\/s11276-012-0438-z","volume":"18","author":"D Karaboga","year":"2012","unstructured":"Karaboga D, Okdem S, Ozturk C (2012) Cluster based wireless sensor network routing using artificial bee colony algorithm. Wireless Netw 18(7):847\u2013860. doi: 10.1007\/s11276-012-0438-z","journal-title":"Wireless Netw"},{"issue":"12","key":"1760_CR39","doi-asserted-by":"crossref","first-page":"4785","DOI":"10.1016\/j.eswa.2013.02.029","volume":"40","author":"A Alvarado-Iniesta","year":"2013","unstructured":"Alvarado-Iniesta A, Garcia-Alcaraz JL, Rodriguez-Borbon MI, Maldonado A (2013) Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm. Expert Syst Appl 40(12):4785\u20134790. doi: 10.1016\/j.eswa.2013.02.029","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1760_CR40","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9(2):625\u2013631. doi: 10.1016\/j.asoc.2008.09.001","journal-title":"Appl Soft Comput"},{"issue":"6","key":"1760_CR41","doi-asserted-by":"crossref","first-page":"6056","DOI":"10.3390\/s110606056","volume":"11","author":"C Ozturk","year":"2011","unstructured":"Ozturk C, Karaboga D, Gorkemli B (2011) Probabilistic dynamic deployment of wireless sensor networks by artificial bee colony algorithm. Sensors 11(6):6056\u20136065","journal-title":"Sensors"},{"key":"1760_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2012.05.002","volume":"209","author":"D Karaboga","year":"2012","unstructured":"Karaboga D, Ozturk C, Karaboga N, Gorkemli B (2012) Artificial bee colony programming for symbolic regression. Inf Sci 209:1\u201315. doi: 10.1016\/j.ins.2012.05.002","journal-title":"Inf Sci"},{"issue":"3","key":"1760_CR43","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1162\/1063656041774947","volume":"12","author":"S Areibi","year":"2004","unstructured":"Areibi S, Yang Z (2004) Effective memetic algorithms for VLSI design automation\u00a0=\u00a0genetic algorithms\u00a0+\u00a0local search\u00a0+\u00a0multi-level clustering. Evol Comput 12(3):327\u2013353. doi: 10.1162\/1063656041774947","journal-title":"Evol Comput"},{"issue":"4","key":"1760_CR44","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.compeleceng.2007.02.003","volume":"33","author":"S Coe","year":"2007","unstructured":"Coe S, Areibi S, Moussa M (2007) A hardware memetic accelerator for VLSI circuit partitioning. Comput Electr Eng 33(4):233\u2013248. doi: 10.1016\/j.compeleceng.2007.02.003","journal-title":"Comput Electr Eng"},{"issue":"1","key":"1760_CR45","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TSMCB.2006.883268","volume":"37","author":"T Maolin","year":"2007","unstructured":"Maolin T, Xin Y (2007) A memetic algorithm for VLSI floorplanning. IEEE Trans Syst Man Cybern B Cybern 37(1):62\u201369. doi: 10.1109\/TSMCB.2006.883268","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"issue":"4","key":"1760_CR46","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1109\/TSMCC.2010.2066560","volume":"41","author":"C Jianli","year":"2011","unstructured":"Jianli C, Wenxing Z, Ali MM (2011) A hybrid simulated annealing algorithm for nonslicing VLSI floorplanning. IEEE Trans Syst Man Cybern Part C Appl Rev 41(4):544\u2013553. doi: 10.1109\/TSMCC.2010.2066560","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"issue":"12","key":"1760_CR47","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. doi: 10.1007\/s00500-009-0501-6","journal-title":"Soft Comput"},{"key":"1760_CR48","doi-asserted-by":"crossref","unstructured":"Zhang H, Ye D (2012) An Artificial bee colony algorithm approach for routing in VLSI. In: Tan Y, Shi Y, Ji Z (eds) Advances in swarm intelligence, vol 7331. Lecture notes in computer science. Springer Berlin, pp 334\u2013341. doi: 10.1007\/978-3-642-30976-2_40","DOI":"10.1007\/978-3-642-30976-2_40"},{"key":"1760_CR49","doi-asserted-by":"crossref","unstructured":"Koch T, Martin A, Vo\u00df S (2000) SteinLib: an updated library on Steiner tree problems in graphs. Technical report. ZIB-Report. Konrad-Zuse-Zentrum fur Informationstechnik Berlin","DOI":"10.1007\/978-1-4613-0255-1_9"},{"issue":"2","key":"1760_CR50","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0114025","volume":"14","author":"M Hanan","year":"1966","unstructured":"Hanan M (1966) On Steiner\u2019s problem with rectilinear distance. SIAM Journal on Applied Mathematics 14(2):255\u2013265. doi: 10.1137\/0114025","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"1760_CR51","unstructured":"Lawler EL (1976) The Steiner problem and other dilemmas. In: Combinatorial optimization: networks and matroids. Holt, Rinehart & Winston, New York, pp 290\u2013296"},{"issue":"2","key":"1760_CR52","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T Feo","year":"1995","unstructured":"Feo T, Resende MC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6(2):109\u2013133. doi: 10.1007\/BF01096763","journal-title":"J Glob Optim"},{"issue":"3","key":"1760_CR53","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K Mehlhorn","year":"1988","unstructured":"Mehlhorn K (1988) A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters 27(3):125\u2013128. doi: 10.1016\/0020-0190(88)90066-X","journal-title":"Information Processing Letters"},{"key":"1760_CR54","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press, Cambridge","edition":"2"},{"key":"1760_CR55","doi-asserted-by":"crossref","unstructured":"Arag\u00e3o M, Werneck R (2002) On the implementation of MST-based heuristics for the Steiner problem in graphs. In: Mount D, Stein C (eds) Algorithm engineering and experiments, vol 2409. Lecture notes in computer science. Springer, Berlin, pp 1\u201315. doi: 10.1007\/3-540-45643-0_1","DOI":"10.1007\/3-540-45643-0_1"},{"key":"1760_CR56","doi-asserted-by":"crossref","unstructured":"Huang T, Young EFY (2010) Obstacle-avoiding rectilinear Steiner minimum tree construction: an optimal approach. In: Proceedings of the international conference on computer-aided design, pp 610\u2013613","DOI":"10.1109\/ICCAD.2010.5654220"},{"key":"1760_CR57","unstructured":"Warme D, Winter P, Zachariasen M (2001) GeoSteiner software for computing Steiner trees. http:\/\/www.diku.dk\/hjemmesider\/ansatte\/martinz\/geosteiner\/"},{"key":"1760_CR58","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.cageo.2011.12.011","volume":"46","author":"P Civicioglu","year":"2012","unstructured":"Civicioglu P (2012) Transforming geocentric cartesian coordinates to geodetic coordinates by using differential search algorithm. Comput Geosci 46:229\u2013247. doi: 10.1016\/j.cageo.2011.12.011","journal-title":"Comput Geosci"},{"issue":"15","key":"1760_CR59","doi-asserted-by":"crossref","first-page":"8121","DOI":"10.1016\/j.amc.2013.02.017","volume":"219","author":"P Civicioglu","year":"2013","unstructured":"Civicioglu P (2013) Backtracking Search Optimization Algorithm for numerical optimization problems. Appl Math Comput 219(15):8121\u20138144. doi: 10.1016\/j.amc.2013.02.017","journal-title":"Appl Math Comput"},{"key":"1760_CR60","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.ins.2012.11.013","volume":"229","author":"P Civicioglu","year":"2013","unstructured":"Civicioglu P (2013) Artificial cooperative search algorithm for numerical optimization problems. Inf Sci 229:58\u201376. doi: 10.1016\/j.ins.2012.11.013","journal-title":"Inf Sci"},{"issue":"5","key":"1760_CR61","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1109\/TEVC.2009.2014613","volume":"13","author":"Z Jingqiao","year":"2009","unstructured":"Jingqiao Z, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945\u2013958. doi: 10.1109\/TEVC.2009.2014613","journal-title":"IEEE Trans Evol Comput"},{"key":"1760_CR62","doi-asserted-by":"crossref","unstructured":"Qin AK, Suganthan PN (2005) Self-adaptive differential evolution algorithm for numerical optimization. In: The 2005 IEEE congress on evolutionary computation, 2005 2\u20135 Sept. 2005 2005, vol 1782. pp 1785\u20131791. doi: 10.1109\/CEC.2005.1554904","DOI":"10.1109\/CEC.2005.1554904"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-014-1760-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-014-1760-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-014-1760-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T19:28:31Z","timestamp":1565983711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-014-1760-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,1]]},"references-count":62,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["1760"],"URL":"https:\/\/doi.org\/10.1007\/s00521-014-1760-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,1]]}}}