{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T13:51:16Z","timestamp":1783605076636,"version":"3.55.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T00:00:00Z","timestamp":1644451200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T00:00:00Z","timestamp":1644451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00521-022-06908-z","type":"journal-article","created":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T18:02:44Z","timestamp":1644516164000},"page":"8853-8884","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":100,"title":["Tangent search algorithm for solving optimization problems"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6553-8253","authenticated-orcid":false,"given":"Abdesslem","family":"Layeb","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,2,10]]},"reference":[{"key":"6908_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.cam.2013.04.004","volume":"253","author":"A Layeb","year":"2013","unstructured":"Layeb A (2013) A hybrid quantum inspired harmony search algorithm for 0\u20131 optimization problems. J Comput Appl Math 253:14\u201325","journal-title":"J Comput Appl Math"},{"key":"6908_CR2","doi-asserted-by":"crossref","unstructured":"T\u00f6rn A, Zilinskas A (1989) Global optimization 989","DOI":"10.1007\/3-540-50871-6"},{"key":"6908_CR3","volume-title":"An introduction to optimization","author":"EKP Chong","year":"2004","unstructured":"Chong EKP, Zak SH (2004) An introduction to optimization. Wiley, Hoboken"},{"issue":"1","key":"6908_CR4","first-page":"168","volume":"215","author":"FM Fern\u00e1ndez","year":"2009","unstructured":"Fern\u00e1ndez FM (2009) On some approximate methods for nonlinear models. Appl Math Comput 215(1):168\u2013174","journal-title":"Appl Math Comput"},{"key":"6908_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-5221-7","volume-title":"Advanced optimization by nature-inspired algorithms","author":"O Bozorg-Haddad","year":"2018","unstructured":"Bozorg-Haddad O (2018) Advanced optimization by nature-inspired algorithms. Springer, Singapore"},{"issue":"3","key":"6908_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1080\/0952813X.2017.1421268","volume":"30","author":"I Ferdi","year":"2018","unstructured":"Ferdi I, Layeb A (2018) A GRASP algorithm based new heuristic for the capacitated location routing problem. J Exp Theor Artif Intell 30(3):369\u2013387","journal-title":"J Exp Theor Artif Intell"},{"key":"6908_CR7","volume-title":"Nonlinear programming: analysis and methods","author":"M Avriel","year":"2003","unstructured":"Avriel M (2003) Nonlinear programming: analysis and methods. Courier Corporation, North Chelmsford"},{"issue":"1","key":"6908_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10589-010-9329-3","volume":"51","author":"F Gao","year":"2012","unstructured":"Gao F, Han L (2012) Implementing the Nelder-Mead simplex algorithm with adaptive parameters. Comput Optim Appl 51(1):259\u2013277","journal-title":"Comput Optim Appl"},{"issue":"1","key":"6908_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V Torczon","year":"1997","unstructured":"Torczon V (1997) On the convergence of pattern search algorithms. SIAM J Optim 7(1):1\u201325","journal-title":"SIAM J Optim"},{"key":"6908_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-94-015-7744-1_2","volume-title":"Simulated annealing: theory and applications","author":"PJM Van Laarhoven","year":"1987","unstructured":"Van Laarhoven PJM, Aarts EHL (1987) Simulated annealing. Simulated annealing: theory and applications. Springer, Dordrecht, pp 7\u201315"},{"issue":"1-2","key":"6908_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0004-3702(95)00040-2","volume":"84","author":"R Greiner","year":"1996","unstructured":"Greiner R (1996) PALO: a probabilistic hill-climbing algorithm. Artif Intell 84(1\u20132):177\u2013208","journal-title":"Artif Intell"},{"issue":"3","key":"6908_CR12","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"11","key":"6908_CR13","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"key":"6908_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-73190-0_2","volume-title":"Introduction to genetic algorithms","author":"SN Sivanandam","year":"2008","unstructured":"Sivanandam SN, Deepa SN (2008) Genetic algorithms. Introduction to genetic algorithms. Springer, Berlin, pp 15\u201337"},{"issue":"1","key":"6908_CR15","first-page":"53","volume":"12","author":"D Karabo\u011fa","year":"2004","unstructured":"Karabo\u011fa D, \u00d6kdem S (2004) A simple and global optimization algorithm for engineering problems: differential evolution algorithm. Turk J Electrical Eng Comput Sci 12(1):53\u201360","journal-title":"Turk J Electrical Eng Comput Sci"},{"key":"6908_CR16","unstructured":"Hu X, Eberhart RC, Shi Y (2003) Engineering optimization with particle swarm. In: Proceedings of the 2003 IEEE swarm intelligence symposium. SIS'03 (Cat. No. 03EX706). IEEE (2003)"},{"issue":"3","key":"6908_CR17","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 Global Optim 39(3):459\u2013471","journal-title":"J Global Optim"},{"issue":"4","key":"6908_CR18","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"6908_CR19","first-page":"169","volume-title":"International symposium on stochastic algorithms","author":"XS Yang","year":"2009","unstructured":"Yang XS (2009) Firefly algorithms for multimodal optimization. International symposium on stochastic algorithms. Springer, Berlin, pp 169\u2013178"},{"issue":"1","key":"6908_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12293-012-0075-1","volume":"4","author":"AYS Lam","year":"2012","unstructured":"Lam AYS, Li VOK (2012) Chemical reaction optimization: a tutorial.\". Memetic Computing 4(1):3\u201317","journal-title":"Memetic Computing"},{"issue":"13","key":"6908_CR21","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, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232\u20132248","journal-title":"Inf Sci"},{"key":"6908_CR22","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/s42235-020-0049-9","volume":"17","author":"X Fan","year":"2020","unstructured":"Fan X et al (2020) Review and classification of bio-inspired algorithms and their applications. J Bionic Eng 17:611\u2013631","journal-title":"J Bionic Eng"},{"key":"6908_CR23","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 (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120\u2013133","journal-title":"Knowl-Based Syst"},{"key":"6908_CR24","doi-asserted-by":"crossref","unstructured":"Zhao J et al (2019) Spherical search optimizer: a simple yet efficient meta-heuristic approach. Neural Comput Appl 1\u201332","DOI":"10.1007\/s00521-019-04510-4"},{"issue":"4","key":"6908_CR25","first-page":"330","volume":"1","author":"X-S Yang","year":"2010","unstructured":"Yang X-S, Deb S (2010) Engineering optimisation by cuckoo search. Int J Math Model Numer Optim 1(4):330\u2013343","journal-title":"Int J Math Model Numer Optim"},{"key":"6908_CR26","doi-asserted-by":"publisher","first-page":"113609","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah L et al (2021) The arithmetic optimization algorithm. Computer Methods Appl Mech Eng 376:113609","journal-title":"Computer Methods Appl Mech Eng"},{"key":"6908_CR27","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:1\u201318","journal-title":"Knowl-Based Syst"},{"key":"6908_CR28","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.asoc.2015.11.015","volume":"39","author":"Mudong","year":"2016","unstructured":"Mudong et al (2016) Cognitive behavior optimization algorithm for solving optimization problems. Appl Soft Comput 39:199\u2013222","journal-title":"Appl Soft Comput"},{"key":"6908_CR29","unstructured":"Gavana A (2014) Global optimization benchmarks and AMPGO"},{"key":"6908_CR30","unstructured":"http:\/\/infinity77.net\/global_optimization\/test_functions.html"},{"key":"6908_CR31","unstructured":"Wu G, Mallipeddi R, Suganthan PN (2017) Problem definitions and evaluation criteria for the CEC 2017 competition on constrained real-parameter optimization. National University of Defense Technology, Changsha, Hunan, PR China and Kyungpook National University, Daegu, South Korea and Nanyang Technological University, Singapore, Technical Report"},{"key":"6908_CR32","unstructured":"Yue CT, Price KV, Suganthan PN, Liang JJ, Ali MZ, Qu BY, Awad NH, Biswas PP (2019) Problem definitions and evaluation criteria for the CEC 2020 special session and competition on single objective bound constrained numerical optimization, Tech. Rep., Zhengzhou University and Nanyang Technological University"},{"key":"6908_CR33","doi-asserted-by":"crossref","unstructured":"Auger A, Hansen N (2012) Tutorial CMA-ES: evolution strategies and covariance matrix adaptation. In: Proceedings of the 14th annual conference companion on genetic and evolutionary computation","DOI":"10.1145\/2330784.2330919"},{"key":"6908_CR34","doi-asserted-by":"crossref","unstructured":"Tanabe R, Fukunaga A (2013) Success-history based parameter adaptation for differential evolution. 2013 IEEE Congr Evol Comput, pp 71\u201378","DOI":"10.1109\/CEC.2013.6557555"},{"key":"6908_CR35","doi-asserted-by":"publisher","first-page":"105190","DOI":"10.1016\/j.knosys.2019.105190","volume":"191","author":"A Faramarzi","year":"2020","unstructured":"Faramarzi A et al (2020) Equilibrium optimizer: a novel optimization algorithm. Knowl Based Syst 191:105190","journal-title":"Knowl Based Syst"},{"key":"6908_CR36","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"6908_CR37","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 et al (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163\u2013191","journal-title":"Adv Eng Softw"},{"key":"6908_CR38","doi-asserted-by":"crossref","unstructured":"Mohamed AW et al (2017) LSHADE with semi-parameter adaptation hybrid with CMA-ES for solving CEC 2017 benchmark problems. In: 2017 IEEE congress on evolutionary computation (CEC). IEEE","DOI":"10.1109\/CEC.2017.7969307"},{"key":"6908_CR39","doi-asserted-by":"crossref","unstructured":"Qi X, Yuan Z, Song Y (2020) A hybrid pathfinder optimizer for unconstrained and constrained optimization problems. Comput Intell Neurosci","DOI":"10.1155\/2020\/5787642"},{"issue":"3","key":"6908_CR40","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/nme.2904","volume":"84","author":"VS Arag\u00f3n","year":"2010","unstructured":"Arag\u00f3n VS, Esquivel SC, Coello Coello CA (2010) A modified version of a T-cell algorithm for constrained optimization problems. Int J Numer Methods Eng 84(3):351\u2013378","journal-title":"Int J Numer Methods Eng"},{"key":"6908_CR41","doi-asserted-by":"crossref","unstructured":"Bernardino HS et al (2008) A new hybrid AIS-GA for constrained optimization problems in mechanical engineering. In: 2008 IEEE congress on evolutionary computation (IEEE world congress on computational intelligence). IEEE","DOI":"10.1109\/CEC.2008.4630985"},{"key":"6908_CR42","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.engappai.2006.03.003","volume":"20","author":"Q He","year":"2007","unstructured":"He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20:89\u201399","journal-title":"Eng Appl Artif Intell"},{"key":"6908_CR43","unstructured":"Montes E, Ocana B (2008) Bacterial foraging for engineering design problems: preliminary results. In: 4th Mex. Congr Evol Comput, COMCEV\u20192008, Mexico, pp 33\u201338"},{"key":"6908_CR44","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1080\/03081070701303470","volume":"37","author":"E Mezura-Montes","year":"2008","unstructured":"Mezura-Montes E, Coello CAC (2008) An empirical study about the usefulness of evolution strategies to solve constrained optimization problems. Int J Gen Syst 37:443\u2013473","journal-title":"Int J Gen Syst"},{"key":"6908_CR45","first-page":"340","volume":"186","author":"F Huang","year":"2007","unstructured":"Huang F, Wang L, He Q (2007) An effective co-evolutionary differential evolution for constrained optimization. Appl Math Comput 186:340\u2013356","journal-title":"Appl Math Comput"},{"key":"6908_CR46","first-page":"392","volume":"211","author":"J Zhang","year":"2009","unstructured":"Zhang J, Liang C, Huang Y, Wu J, Yang S (2009) An effective multiagent evolutionary algorithm integrating a novel roulette inversion operator for engineering optimization. Appl Math Comput 211:392\u2013416","journal-title":"Appl Math Comput"},{"key":"6908_CR47","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.advengsoft.2017.03.014","volume":"110","author":"A Kaveh","year":"2017","unstructured":"Kaveh A, Dadras A (2017) A novel meta-heuristic optimization algorithm: thermal exchange optimization. Adv Eng Softw 110:69\u201384","journal-title":"Adv Eng Softw"},{"key":"6908_CR48","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0166-3615(99)00046-9","volume":"41","author":"CA Coello Coello","year":"2000","unstructured":"Coello Coello CA (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41:113\u2013127","journal-title":"Comput Ind"},{"key":"6908_CR49","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/03052150410001647966","volume":"36","author":"CAC Coello","year":"2004","unstructured":"Coello CAC, Becerra RL (2004) Efficient evolutionary optimization through the use of a cultural algorithm. Eng Optim 36:219\u2013236","journal-title":"Eng Optim"},{"issue":"15","key":"6908_CR50","doi-asserted-by":"publisher","first-page":"3043","DOI":"10.1016\/j.ins.2008.02.014","volume":"178","author":"M Zhang","year":"2008","unstructured":"Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178(15):3043\u20133074","journal-title":"Inf Sci"},{"issue":"4","key":"6908_CR51","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00158-008-0238-3","volume":"37","author":"Y Wang","year":"2009","unstructured":"Wang Y, Cai ZX, Zhou YR, Fan Z (2009) Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling technique. Struct Multidiscip Optim 37(4):395\u2013413","journal-title":"Struct Multidiscip Optim"},{"issue":"2","key":"6908_CR52","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"},{"key":"6908_CR53","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.engappai.2019.03.021","volume":"82","author":"G Dhiman","year":"2019","unstructured":"Dhiman G, Kaur A (2019) STOA: a bio-inspired based optimization algorithm for industrial engineering problems. Eng Appl Artif Intell 82:148\u2013174","journal-title":"Eng Appl Artif Intell"},{"key":"6908_CR54","doi-asserted-by":"publisher","first-page":"9167414","DOI":"10.1155\/2018\/9167414","volume":"2018","author":"H Wang","year":"2018","unstructured":"Wang H, Hu Z, Sun Y, Su Q, Xia X (2018) Modified backtracking search optimization algorithm inspired by simulated annealing for constrained engineering optimization problems. Comput Intell Neurosci 2018:9167414","journal-title":"Comput Intell Neurosci"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-06908-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-06908-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-06908-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T08:09:38Z","timestamp":1726646978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-06908-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,10]]},"references-count":54,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["6908"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-06908-z","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,10]]},"assertion":[{"value":"7 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}