{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:07:12Z","timestamp":1771700832560,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"S4","license":[{"start":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T00:00:00Z","timestamp":1627430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T00:00:00Z","timestamp":1627430400000},"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":["Engineering with Computers"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00366-021-01467-8","type":"journal-article","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T19:02:45Z","timestamp":1627498965000},"page":"3539-3562","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Enhanced harmony search algorithm with non-linear control parameters for global optimization and engineering design problems"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3779-2932","authenticated-orcid":false,"given":"Shubham","family":"Gupta","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,28]]},"reference":[{"key":"1467_CR1","doi-asserted-by":"publisher","first-page":"115079","DOI":"10.1016\/j.eswa.2021.115079","volume":"181","author":"I Ahmadianfar","year":"2021","unstructured":"Ahmadianfar I, Heidari AA, Gandomi AH, Chu X, Chen H (2021). RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method. Expert Syst Appl 181:115079. https:\/\/doi.org\/10.1016\/j.eswa.2021.115079","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1467_CR2","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1016\/j.eswa.2014.10.008","volume":"42","author":"MA Al-Betar","year":"2015","unstructured":"Al-Betar MA, Awadallah MA, Khader AT, Abdalkareem ZA (2015) Island-based harmony search for optimization problems. Expert Syst Appl 42(4):2026\u20132035","journal-title":"Expert Syst Appl"},{"issue":"9","key":"1467_CR3","doi-asserted-by":"crossref","first-page":"2687","DOI":"10.1016\/j.amc.2010.03.114","volume":"216","author":"B Alatas","year":"2010","unstructured":"Alatas B (2010) Chaotic harmony search algorithms. Appl Math Comput 216(9):2687\u20132699","journal-title":"Appl Math Comput"},{"key":"1467_CR4","volume-title":"Introduction to optimum design","author":"JS Arora","year":"1989","unstructured":"Arora JS (1989). Introduction to optimum design. New York: McGraw-Hill"},{"key":"1467_CR5","doi-asserted-by":"crossref","unstructured":"Assad A, Deep K (2016) Applications of harmony search algorithm in data mining: a survey. In: Proceedings of fifth international conference on soft computing for problem solving. Springer, pp 863\u2013874","DOI":"10.1007\/978-981-10-0451-3_77"},{"issue":"4","key":"1467_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.3233\/FI-2009-157","volume":"95","author":"P Chakraborty","year":"2009","unstructured":"Chakraborty P, Roy GG, Das S, Jain D, Abraham A (2009) An improved harmony search algorithm with differential mutation operator. Fundam Inform 95(4):401\u2013426","journal-title":"Fundam Inform"},{"issue":"1","key":"1467_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2010","unstructured":"Das S, Suganthan PN (2010) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4\u201331","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1467_CR8","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":"1467_CR9","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.amc.2013.07.020","volume":"222","author":"M El-Abd","year":"2013","unstructured":"El-Abd M (2013) An improved global-best harmony search algorithm. Appl Math Comput 222:94\u2013106","journal-title":"Appl Math Comput"},{"key":"1467_CR10","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1016\/j.amc.2014.09.071","volume":"247","author":"L-Q Gao","year":"2014","unstructured":"Gao L-Q, Li S, Kong X, Zou D-X et al (2014) On the iterative convergence of harmony search algorithm and a proposed modification. Appl Math Comput 247:1064\u20131095","journal-title":"Appl Math Comput"},{"issue":"2","key":"1467_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368","journal-title":"Simulation"},{"issue":"4","key":"1467_CR12","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1007\/s00500-016-2424-3","volume":"22","author":"Z Guo","year":"2018","unstructured":"Guo Z, Yang H, Wang S, Zhou C, Liu X (2018) Adaptive harmony search with best-based search strategy. Soft Comput 22(4):1335\u20131349","journal-title":"Soft Comput"},{"issue":"2","key":"1467_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies. Evol Comput 9(2):159\u2013195","journal-title":"Evol Comput"},{"key":"1467_CR14","doi-asserted-by":"publisher","unstructured":"Hasanipanah M, Keshtegar B, Thai DK, Troung NT (2020) An ANN-adaptive dynamical harmony search algorithm to approximate the flyrock resulting from blasting. Eng Comput 1\u201313. https:\/\/doi.org\/10.1007\/s00366-020-01105-9","DOI":"10.1007\/s00366-020-01105-9"},{"key":"1467_CR15","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari AA, Mirjalili S, Faris H, Aljarah I, Mafarja M, Chen H (2019) Harris hawks optimization: algorithm and applications. Future Gen Comput Syst 97:849\u2013872","journal-title":"Future Gen Comput Syst"},{"issue":"11","key":"1467_CR16","doi-asserted-by":"publisher","first-page":"3316","DOI":"10.1016\/j.cnsns.2010.01.009","volume":"15","author":"M Jaberipour","year":"2010","unstructured":"Jaberipour M, Khorram E (2010) Two improved harmony search algorithms for solving engineering optimization problems. Commun Nonlinear Sci Numer Simul 15(11):3316\u20133331","journal-title":"Commun Nonlinear Sci Numer Simul"},{"key":"1467_CR17","doi-asserted-by":"publisher","unstructured":"Kannan BK, Kramer SN (1994). An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. 405\u2013411. https:\/\/doi.org\/10.1115\/1.2919393","DOI":"10.1115\/1.2919393"},{"issue":"3","key":"1467_CR18","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"},{"key":"1467_CR19","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-international conference on neural networks, vol\u00a04, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"7","key":"1467_CR20","doi-asserted-by":"publisher","first-page":"e2163","DOI":"10.1002\/stc.2163","volume":"25","author":"B Keshtegar","year":"2018","unstructured":"Keshtegar B, Etedali S (2018) Nonlinear mathematical modeling and optimum design of tuned mass dampers using adaptive dynamic harmony search algorithm. Struct Control Health Monit 25(7):e2163","journal-title":"Struct Control Health Monit"},{"key":"1467_CR21","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.asoc.2018.02.020","volume":"66","author":"B Keshtegar","year":"2018","unstructured":"Keshtegar B, Hao P, Wang Y, Hu Q (2018) An adaptive response surface method and gaussian global-best harmony search algorithm for optimization of aircraft stiffened panels. Appl Soft Comput 66:196\u2013207","journal-title":"Appl Soft Comput"},{"key":"1467_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tws.2017.05.004","volume":"118","author":"B Keshtegar","year":"2017","unstructured":"Keshtegar B, Hao P, Wang Y, Li Y (2017a) Optimum design of aircraft panels based on adaptive dynamic harmony search. Thin Walled Struct 118:37\u201345","journal-title":"Thin Walled Struct"},{"issue":"3","key":"1467_CR23","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00366-016-0481-y","volume":"33","author":"B Keshtegar","year":"2017","unstructured":"Keshtegar B, Ozbakkaloglu T, Gholampour A (2017b) Modeling the behavior of FRP-confined concrete using dynamic harmony search algorithm. Eng Comput 33(3):415\u2013430","journal-title":"Eng Comput"},{"issue":"24","key":"1467_CR24","doi-asserted-by":"publisher","first-page":"7337","DOI":"10.1007\/s00500-016-2274-z","volume":"21","author":"B Keshtegar","year":"2017","unstructured":"Keshtegar B, Sadeq MO (2017) Gaussian global-best harmony search algorithm for optimization problems. Soft Comput 21(24):7337\u20137349","journal-title":"Soft Comput"},{"key":"1467_CR25","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.amc.2013.11.058","volume":"228","author":"M Khalili","year":"2014","unstructured":"Khalili M, Kharrat R, Salahshoor K, Sefat MH (2014) Global dynamic harmony search algorithm: GDHS. Appl Math Comput 228:195\u2013219","journal-title":"Appl Math Comput"},{"issue":"2","key":"1467_CR26","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.jocs.2013.12.001","volume":"5","author":"V Kumar","year":"2014","unstructured":"Kumar V, Chhabra JK, Kumar D (2014) Parameter adaptive harmony search algorithm for unimodal and multimodal optimization problems. J Comput Sci 5(2):144\u2013155","journal-title":"J Comput Sci"},{"key":"1467_CR27","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","volume":"111","author":"S Li","year":"2020","unstructured":"Li S, Chen H, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: a new method for stochastic optimization. Future Gen Comput Syst 111:300\u2013323","journal-title":"Future Gen Comput Syst"},{"issue":"3","key":"1467_CR28","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"JJ Liang","year":"2006","unstructured":"Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10(3):281\u2013295","journal-title":"IEEE Trans Evol Comput"},{"key":"1467_CR29","doi-asserted-by":"publisher","unstructured":"Luo K (2013) A novel self-adaptive harmony search algorithm. J Appl Math 2013. https:\/\/doi.org\/10.1155\/2013\/653749","DOI":"10.1155\/2013\/653749"},{"key":"1467_CR30","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.ins.2019.01.019","volume":"482","author":"K Luo","year":"2019","unstructured":"Luo K, Ma J, Zhao Q (2019) Enhanced self-adaptive global-best harmony search without any extra statistic and external archive. Inf Sci 482:228\u2013247","journal-title":"Inf Sci"},{"issue":"2","key":"1467_CR31","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.asoc.2009.08.038","volume":"10","author":"K Mahadevan","year":"2010","unstructured":"Mahadevan K, Kannan P (2010) Comprehensive learning particle swarm optimization for reactive power dispatch. Appl Soft Comput 10(2):641\u2013652","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1467_CR32","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1016\/j.amc.2006.11.033","volume":"188","author":"M Mahdavi","year":"2007","unstructured":"Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188(2):1567\u20131579","journal-title":"Appl Math Comput"},{"key":"1467_CR33","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":"1467_CR34","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":"1467_CR35","doi-asserted-by":"publisher","unstructured":"Nehdi ML, Keshtegar B, Zhu SP (2019) Nonlinear modeling for bar bond stress using dynamical self-adjusted harmony search optimization. Eng Comput. 1\u201312. https:\/\/doi.org\/10.1007\/s00366-019-00831-z","DOI":"10.1007\/s00366-019-00831-z"},{"key":"1467_CR36","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.asoc.2016.12.042","volume":"53","author":"H-B Ouyang","year":"2017","unstructured":"Ouyang H-B, Gao L-Q, Li S, Kong X-Y, Wang Q, Zou D-X (2017) Improved harmony search algorithm: LHS. Appl Soft Comput 53:133\u2013167","journal-title":"Appl Soft Comput"},{"key":"1467_CR37","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.renene.2014.09.027","volume":"75","author":"S Salcedo-Sanz","year":"2015","unstructured":"Salcedo-Sanz S, Pastor-S\u00e1nchez A, Del Ser J, Prieto L, Geem Z-W (2015) A coral reefs optimization algorithm with harmony search operators for accurate wind speed prediction. Renew Energy 75:93\u2013101","journal-title":"Renew Energy"},{"issue":"1","key":"1467_CR38","doi-asserted-by":"publisher","first-page":"279","DOI":"10.3233\/IFS-141298","volume":"28","author":"A Shahraki","year":"2015","unstructured":"Shahraki A, Ebrahimi SB (2015) A new approach for forecasting enrollments using harmony search algorithm. J Intell Fuzzy Syst 28(1):279\u2013290","journal-title":"J Intell Fuzzy Syst"},{"issue":"4","key":"1467_CR39","doi-asserted-by":"publisher","first-page":"2826","DOI":"10.1016\/j.eswa.2009.09.008","volume":"37","author":"C-M Wang","year":"2010","unstructured":"Wang C-M, Huang Y-F (2010) Self-adaptive harmony search algorithm for optimization. Expert Syst Appl 37(4):2826\u20132837","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1467_CR40","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12293-016-0212-3","volume":"10","author":"G-G Wang","year":"2018","unstructured":"Wang G-G (2018) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memet Comput 10(2):151\u2013164","journal-title":"Memet Comput"},{"issue":"7","key":"1467_CR41","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1007\/s00521-015-1923-y","volume":"31","author":"G-G Wang","year":"2019","unstructured":"Wang G-G, Deb S, Cui Z (2019) Monarch butterfly optimization. Neural Comput Appl 31(7):1995\u20132014","journal-title":"Neural Comput Appl"},{"key":"1467_CR42","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.knosys.2014.10.013","volume":"73","author":"Y Wang","year":"2015","unstructured":"Wang Y, Liu Y, Feng L, Zhu X (2015) Novel feature selection method based on harmony search for email classification. Knowl Based Syst 73:311\u2013323","journal-title":"Knowl Based Syst"},{"issue":"2","key":"1467_CR43","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley D (1994) A genetic algorithm tutorial. Stat Comput 4(2):65\u201385","journal-title":"Stat Comput"},{"issue":"1","key":"1467_CR44","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382","journal-title":"IEEE Trans Evol Comput"},{"key":"1467_CR45","unstructured":"Nowcki H. Optimization in pre-contract ship design. In: Fujita Y, Lind K, Williams TJ (eds) Computer Applications in the Automation of Shipyard Operation and Ship Design, vol 2. North-Holland, Elsevier, New York, pp 327\u2013338"},{"key":"1467_CR46","doi-asserted-by":"publisher","first-page":"114864","DOI":"10.1016\/j.eswa.2021.114864","volume":"177","author":"Y Yang","year":"2021","unstructured":"Yang Y, Chen H, Heidari AA, Gandomi AH (2021) Hunger games search: visions, conception, implementation, deep analysis, perspectives, and towards performance shifts. Expert Syst Appl 177:114864","journal-title":"Expert Syst Appl"},{"issue":"7","key":"1467_CR47","doi-asserted-by":"crossref","first-page":"3166","DOI":"10.1016\/j.amc.2010.08.049","volume":"217","author":"G Zhu","year":"2010","unstructured":"Zhu G, Kwong S (2010) Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl Math Comput 217(7):3166\u20133173","journal-title":"Appl Math Comput"},{"issue":"16\u201318","key":"1467_CR48","doi-asserted-by":"publisher","first-page":"3308","DOI":"10.1016\/j.neucom.2010.07.010","volume":"73","author":"D Zou","year":"2010","unstructured":"Zou D, Gao L, Wu J, Li S (2010) Novel global harmony search algorithm for unconstrained problems. Neurocomputing 73(16\u201318):3308\u20133318","journal-title":"Neurocomputing"}],"container-title":["Engineering with Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-021-01467-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00366-021-01467-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-021-01467-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T16:10:00Z","timestamp":1699287000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00366-021-01467-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,28]]},"references-count":48,"journal-issue":{"issue":"S4","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1467"],"URL":"https:\/\/doi.org\/10.1007\/s00366-021-01467-8","relation":{},"ISSN":["0177-0667","1435-5663"],"issn-type":[{"value":"0177-0667","type":"print"},{"value":"1435-5663","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,28]]},"assertion":[{"value":"6 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}