{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:19:12Z","timestamp":1770337152981,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"24","license":[{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572225"],"award-info":[{"award-number":["61572225"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007847","name":"Natural Science Foundation of Jilin Province","doi-asserted-by":"publisher","award":["20180101044JC"],"award-info":[{"award-number":["20180101044JC"]}],"id":[{"id":"10.13039\/100007847","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011788","name":"Jilin Province Philosophy and Social Science Planning Fund Office","doi-asserted-by":"publisher","award":["2019B68"],"award-info":[{"award-number":["2019B68"]}],"id":[{"id":"10.13039\/501100011788","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010211","name":"Education Department of Jilin Province","doi-asserted-by":"publisher","award":["JJKH20180465KJ"],"award-info":[{"award-number":["JJKH20180465KJ"]}],"id":[{"id":"10.13039\/501100010211","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010747","name":"Jilin University of Finance and Economics","doi-asserted-by":"publisher","award":["2018Z05"],"award-info":[{"award-number":["2018Z05"]}],"id":[{"id":"10.13039\/100010747","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,12]]},"DOI":"10.1007\/s00500-020-05099-w","type":"journal-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T14:22:00Z","timestamp":1596118920000},"page":"18627-18646","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["TSASC: tree\u2013seed algorithm with sine\u2013cosine enhancement for continuous optimization problems"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9149-2922","authenticated-orcid":false,"given":"Jianhua","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianqiu","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keqin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"issue":"1","key":"5099_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0303-2647(94)90062-0","volume":"33","author":"PJ Angeline","year":"1994","unstructured":"Angeline PJ (1994) Genetic programming: on the programming of computers by means of natural selection. Biosystems 33(1):69\u201373","journal-title":"Biosystems"},{"key":"5099_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.asoc.2017.10.013","volume":"63","author":"A Babalik","year":"2018","unstructured":"Babalik A, Cinar AC, Kiran MS (2018) A modification of tree-seed algorithm using Deb\u2019s rules for constrained optimization. Appl Soft Comput 63:289\u2013305","journal-title":"Appl Soft Comput"},{"issue":"1","key":"5099_CR3","first-page":"70","volume":"27","author":"L Bai","year":"2014","unstructured":"Bai L, Li Y, Gong L (2014) Protein secondary structure optimization using an improved artificial bee colony algorithm based on AB offlattice model. Eng Appl Artif Intell 27(1):70\u201379","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"5099_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H Beyer","year":"2002","unstructured":"Beyer H, Schwefel H (2002) Evolution strategies\u2014a comprehensive introduction. Nat Comput 1(1):3\u201352","journal-title":"Nat Comput"},{"issue":"1","key":"5099_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V Cern\u00fd","year":"1985","unstructured":"Cern\u00fd V (1985) Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45(1):41\u201351","journal-title":"J Optim Theory Appl"},{"key":"5099_CR6","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1587\/transinf.2019EDP7015","volume":"8","author":"W Chen","year":"2019","unstructured":"Chen W, Cai M, Tan X, Wei B (2019) Parameter identification and state-of-charge estimation for Li-ion batteries using an improved tree seed algorithm. IEICE Trans Inf Syst 8:1489\u20131497","journal-title":"IEICE Trans Inf Syst"},{"issue":"14","key":"5099_CR7","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1016\/S0045-7949(01)00027-X","volume":"79","author":"J Chou","year":"2001","unstructured":"Chou J, Ghaboussi J (2001) Genetic algorithm in structural damage detection. Comput Struct 79(14):1335\u20131353","journal-title":"Comput Struct"},{"key":"5099_CR8","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/j.cie.2017.12.009","volume":"115","author":"AC Cinar","year":"2018","unstructured":"Cinar AC, Kiran MS (2018) Similarity and logic gate-based tree-seed algorithms for binary optimization. Comput Ind Eng 115:631\u2013646","journal-title":"Comput Ind Eng"},{"issue":"2","key":"5099_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0166-3615(99)00046-9","volume":"41","author":"CAC Coello","year":"2000","unstructured":"Coello CAC (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41(2):113\u2013127","journal-title":"Comput Ind"},{"issue":"6","key":"5099_CR10","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"S Dan","year":"2008","unstructured":"Dan S (2008) Biogeography based optimization. IEEE Trans Evol Comput 12(6):702\u2013713","journal-title":"IEEE Trans Evol Comput"},{"key":"5099_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.swevo.2019.02.005","volume":"46","author":"Z Ding","year":"2019","unstructured":"Ding Z, Li J, Hao H, Lu Z (2019a) Nonlinear hysteretic parameter identification using an improved tree-seed algorithm. Swarm Evol Comput 46:69\u201383","journal-title":"Swarm Evol Comput"},{"key":"5099_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.engstruct.2019.01.118","volume":"185","author":"Z Ding","year":"2019","unstructured":"Ding Z, Li J, Hao H, Lu Z (2019b) Structural damage identification with uncertain modelling error and measurement noise by clustering based tree seeds algorithm. Eng Struct 185:301\u2013314","journal-title":"Eng Struct"},{"key":"5099_CR13","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.eswa.2017.07.043","volume":"90","author":"MA Elaziz","year":"2017","unstructured":"Elaziz MA, Oliva D, Xiong S (2017) An improved opposition-based sine cosine algorithm for global optimization. Expert Syst Appl 90:484\u2013500","journal-title":"Expert Syst Appl"},{"issue":"1","key":"5099_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s12597-009-0003-4","volume":"46","author":"RA Formato","year":"2009","unstructured":"Formato RA (2009) Central force optimization: a new deterministic gradientlike optimization metaheuristic. Opsearch 46(1):25\u201351","journal-title":"Opsearch"},{"key":"5099_CR15","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.eswa.2018.10.050","volume":"119","author":"S Gupta","year":"2019","unstructured":"Gupta S, Deep K (2019) A hybrid self-adaptive sine cosine algorithm with opposition based learning. Expert Syst Appl 119:210\u2013230","journal-title":"Expert Syst Appl"},{"key":"5099_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222:175\u2013184","journal-title":"Inf Sci"},{"key":"5099_CR17","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.eswa.2018.01.019","volume":"99","author":"M Issa","year":"2018","unstructured":"Issa M, Hassanien AE, Oliva D, Helmi A, Ziedan I, Alzohairy AM (2018) ASCA-PSO: adaptive sine cosine optimization algorithm integrated with particle swarm for pairwise local sequence alignment. Expert Syst Appl 99:56\u201370","journal-title":"Expert Syst Appl"},{"key":"5099_CR18","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.future.2016.05.013","volume":"74","author":"J Jiang","year":"2017","unstructured":"Jiang J, Feng Y, Zhao J, Li K (2017) DataABC: a fast ABC based energy-efficient live VM consolidation policy with data-intensive energy evaluation model. Future Gener Comput Syst 74:132\u2013141","journal-title":"Future Gener Comput Syst"},{"key":"5099_CR19","doi-asserted-by":"publisher","first-page":"122323","DOI":"10.1016\/j.physa.2019.122323","volume":"534","author":"J Jiang","year":"2019","unstructured":"Jiang J, Jiang S, Meng X, Qiu C (2019a) EST-TSA: an effective search tendency based to tree seed algorithm. Phys A Stat Mech Appl 534:122323","journal-title":"Phys A Stat Mech Appl"},{"key":"5099_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.asoc.2018.12.006","volume":"76","author":"J Jiang","year":"2019","unstructured":"Jiang J, Wu D, Chen Y, Li K (2019b) Complex network oriented artificial bee colony algorithm for global bi-objective optimization in three-echelon supply chain. Appl Soft Comput 76:193\u2013204","journal-title":"Appl Soft Comput"},{"key":"5099_CR21","doi-asserted-by":"publisher","first-page":"122802","DOI":"10.1016\/j.physa.2019.122802","volume":"537","author":"J Jiang","year":"2020","unstructured":"Jiang J, Xu M, Meng X, Li K (2020) STSA: a sine Tree-Seed Algorithm for complex continuous optimization problems. Phys A Stat Mech Appl 537:122802","journal-title":"Phys A Stat Mech Appl"},{"issue":"3","key":"5099_CR22","doi-asserted-by":"publisher","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","journal-title":"J Glob Optim"},{"issue":"19","key":"5099_CR23","doi-asserted-by":"publisher","first-page":"6686","DOI":"10.1016\/j.eswa.2015.04.055","volume":"42","author":"MS Kiran","year":"2015","unstructured":"Kiran MS (2015) TSA: tree-seed algorithm for continuous optimization. Expert Syst Appl 42(19):6686\u20136698","journal-title":"Expert Syst Appl"},{"key":"5099_CR24","volume-title":"Intelligent and evolutionary systems","author":"MS Kiran","year":"2016","unstructured":"Kiran MS (2016) An implementation of tree-seed algorithm (TSA) for constrained optimization. In: Lavangnananda K, Phon-Amnuaisuk S, Engchuan W, Chan J (eds) Intelligent and evolutionary systems. Springer, Cham"},{"key":"5099_CR25","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.procs.2017.06.008","volume":"111","author":"MS Kiran","year":"2017","unstructured":"Kiran MS (2017) Withering process for tree-seed algorithm. Proc Comput Sci 111:46\u201351","journal-title":"Proc Comput Sci"},{"issue":"16","key":"5099_CR26","doi-asserted-by":"publisher","first-page":"4732","DOI":"10.1080\/00207543.2013.767988","volume":"51","author":"X Li","year":"2013","unstructured":"Li X, Yin M (2013) A hybrid cuckoo search via l\u00e9vy flights for the permutation flow shop scheduling problem. Int J Prod Res 51(16):4732\u20134754","journal-title":"Int J Prod Res"},{"key":"5099_CR27","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.eswa.2017.08.038","volume":"91","author":"S Li","year":"2018","unstructured":"Li S, Fang H, Liu X (2018) Parameter optimization of support vector regression based on sine cosine algorithm. Expert Syst Appl 91:63\u201377","journal-title":"Expert Syst Appl"},{"key":"5099_CR28","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.knosys.2016.04.025","volume":"105","author":"C Liu","year":"2016","unstructured":"Liu C, Fan L (2016) A hybrid evolutionary algorithm based on tissue membrane systems and CMA-ES for solving numerical optimization problems. Knowl Based Syst 105:38\u201347","journal-title":"Knowl Based Syst"},{"issue":"4","key":"5099_CR29","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s00521-015-1920-1","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016a) Dragonfly algorithm: a new metaheuristic optimization technique for solving singleobjective, discrete, and multiobjective problems. Neural Comput Appl 27(4):1053\u20131073","journal-title":"Neural Comput Appl"},{"issue":"96","key":"5099_CR30","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016b) SCA: a sine cosine algorithm for solving optimization problems. Knowl Based Syst 96(96):120\u2013133","journal-title":"Knowl Based Syst"},{"key":"5099_CR31","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.advengsoft.2017.07.002","volume":"114","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Gandomi HA, Mirjalili SZ (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163\u2013191","journal-title":"Adv Eng Softw"},{"issue":"9","key":"5099_CR32","doi-asserted-by":"publisher","first-page":"5497","DOI":"10.1007\/s00521-018-3376-6","volume":"31","author":"H Nenavath","year":"2019","unstructured":"Nenavath H, Jatoth RK (2019) Hybrid SCA-TLBO: a novel optimization algorithm for global optimization and visual tracking. Neural Comput Appl 31(9):5497\u20135526","journal-title":"Neural Comput Appl"},{"issue":"5","key":"5099_CR33","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.2514\/1.48475","volume":"33","author":"M Pontani","year":"2010","unstructured":"Pontani M, Conway BA (2010) Particle swarm optimization applied to space trajectories. J Guid Control Dyn 33(5):1429\u20131441","journal-title":"J Guid Control Dyn"},{"issue":"2","key":"5099_CR34","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C Rajendran","year":"2007","unstructured":"Rajendran C, Ziegler H (2007) Antcolony algorithms for permutation flowshop scheduling to minimize makespan total flowtime of jobs. Eur J Oper Res 155(2):426\u2013438","journal-title":"Eur J Oper Res"},{"issue":"13","key":"5099_CR35","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadipour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232\u20132248","journal-title":"Inf Sci"},{"issue":"C","key":"5099_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2014.07.025","volume":"75","author":"H Salimi","year":"2015","unstructured":"Salimi H (2015) Stochastic fractal search: a powerful metaheuristic algorithm. Knowl Based Syst 75(C):1\u201318","journal-title":"Knowl Based Syst"},{"issue":"10","key":"5099_CR37","doi-asserted-by":"publisher","first-page":"2947","DOI":"10.1007\/s00521-017-2837-7","volume":"28","author":"R Sindhu","year":"2017","unstructured":"Sindhu R, Ngadiran R, Yacob YM, Zahri NAH, Hariharan M (2017) Sine\u2013cosine algorithm for feature selection with elitism strategy and new updating mechanism. Neural Comput Appl 28(10):2947\u20132958","journal-title":"Neural Comput Appl"},{"issue":"6","key":"5099_CR38","first-page":"1586","volume":"20","author":"N Singh","year":"2017","unstructured":"Singh N, Singh SB (2017) A novel hybrid GWO-SCA approach for optimization problems. Eng Sci Technol Int J 20(6):1586\u20131601","journal-title":"Eng Sci Technol Int J"},{"issue":"6","key":"5099_CR39","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/2.294849","volume":"27","author":"M Srinivas","year":"1994","unstructured":"Srinivas M, Patnaik LM (1994) Genetic algorithms: a survey. IEEE Comput 27(6):17\u201326","journal-title":"IEEE Comput"},{"issue":"4","key":"5099_CR40","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1155\/2013\/625914","volume":"20","author":"Z Tabrizian","year":"2013","unstructured":"Tabrizian Z, Afshari E, Amiri GG, Beygi MH, Nejad SMP (2013) A new damage detection method: big bang-big crunch (BB-BC) algorithm. Shock Vib 20(4):633\u2013648","journal-title":"Shock Vib"},{"issue":"8","key":"5099_CR41","doi-asserted-by":"publisher","first-page":"129","DOI":"10.2514\/2.2111","volume":"41","author":"G Venter","year":"2003","unstructured":"Venter G, Sobieszczanskisobieski J (2003) Particle swarm optimization. AIAA J 41(8):129\u2013132","journal-title":"AIAA J"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05099-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-020-05099-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05099-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T01:11:08Z","timestamp":1624497068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-020-05099-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,24]]},"references-count":41,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["5099"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05099-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,24]]},"assertion":[{"value":"24 June 2020","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":"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 or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}