{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T21:33:50Z","timestamp":1764020030824,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2015,10,30]],"date-time":"2015-10-30T00:00:00Z","timestamp":1446163200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41561091"],"award-info":[{"award-number":["41561091"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61462036"],"award-info":[{"award-number":["61462036"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61402481"],"award-info":[{"award-number":["61402481"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00500-015-1912-1","type":"journal-article","created":{"date-parts":[[2015,10,30]],"date-time":"2015-10-30T06:54:33Z","timestamp":1446188073000},"page":"2129-2137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Global harmony search with generalized opposition-based learning"],"prefix":"10.1007","volume":"21","author":[{"given":"Zhaolu","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenwen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuezhi","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huogen","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,30]]},"reference":[{"issue":"1","key":"1912_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.3233\/JHS-140484","volume":"20","author":"V Abedifar","year":"2014","unstructured":"Abedifar V, Eshghi M (2014) An optimized design of optical networks using evolutionary algorithms. J High Speed Netw 20(1):11\u201327","journal-title":"J High Speed Netw"},{"issue":"10","key":"1912_CR2","doi-asserted-by":"crossref","first-page":"6095","DOI":"10.1016\/j.amc.2011.11.095","volume":"218","author":"MA Al-Betar","year":"2012","unstructured":"Al-Betar MA, Doush IA, Khader AT, Awadallah MA (2012) Novel selection schemes for harmony search. Appl Math Comput 218(10):6095\u20136117","journal-title":"Appl Math Comput"},{"issue":"4","key":"1912_CR3","doi-asserted-by":"crossref","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":"4","key":"1912_CR4","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/s10898-004-9972-2","volume":"31","author":"MM Ali","year":"2005","unstructured":"Ali MM, Khompatraporn C, Zabinsky ZB (2005) A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J Glob Optim 31(4):635\u2013672","journal-title":"J Glob Optim"},{"issue":"8","key":"1912_CR5","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1007\/s00500-013-1158-8","volume":"18","author":"TS Bindiya","year":"2014","unstructured":"Bindiya TS, Elias E (2014) Metaheuristic algorithms for the design of multiplier-less non-uniform filter banks based on frequency response masking. Soft Comput 18(8):1529\u20131547","journal-title":"Soft Comput"},{"key":"1912_CR6","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.ins.2014.04.001","volume":"279","author":"M Castelli","year":"2014","unstructured":"Castelli M, Silva S, Manzoni L, Vanneschi L (2014) Geometric selective harmony search. Inform Sci 279:468\u2013482","journal-title":"Inform Sci"},{"issue":"2","key":"1912_CR7","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.amc.2012.06.048","volume":"219","author":"J Chen","year":"2012","unstructured":"Chen J, Pan Q-K, Li J-Q (2012) Harmony search algorithm with dynamic control parameters. Appl Math Comput 219(2):592\u2013604","journal-title":"Appl Math Comput"},{"issue":"6","key":"1912_CR8","doi-asserted-by":"crossref","first-page":"2558","DOI":"10.1016\/j.amc.2011.07.073","volume":"218","author":"C Cobos","year":"2011","unstructured":"Cobos C, Estupi\u00f1\u00e1n D, P\u00e9rez J (2011) GHS+ LEM: global-best harmony search using learnable evolution models. Appl Math Comput 218(6):2558\u20132578","journal-title":"Appl Math Comput"},{"issue":"1","key":"1912_CR9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/TSMCB.2010.2046035","volume":"41","author":"S Das","year":"2011","unstructured":"Das S, Mukhopadhyay A, Roy A, Abraham A, Panigrahi BK (2011) Exploratory power of the harmony search algorithm: analysis and improvements for global numerical optimization. IEEE Trans Syst Man Cybern Part B Cybern 41(1):89\u2013106","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"1912_CR10","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"},{"issue":"5\u20138","key":"1912_CR11","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1007\/s00170-011-3197-6","volume":"56","author":"K-Z Gao","year":"2011","unstructured":"Gao K-Z, Pan Q-K, Li J-Q (2011) Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion. Int J Adv Manuf Technol 56(5\u20138):683\u2013692","journal-title":"Int J Adv Manuf Technol"},{"issue":"8","key":"1912_CR12","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1080\/0305215X.2011.628387","volume":"44","author":"XZ Gao","year":"2012","unstructured":"Gao XZ, Wang X, Ovaska SJ, Zenger K (2012) A hybrid optimization method of harmony search and opposition-based learning. Eng Optim 44(8):895\u2013914","journal-title":"Eng Optim"},{"issue":"2","key":"1912_CR13","doi-asserted-by":"crossref","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":"1","key":"1912_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1504\/IJCSM.2015.067543","volume":"6","author":"Z Guo","year":"2015","unstructured":"Guo Z, Yue X, Zhang K, Deng C, Liu S (2015) Enhanced social emotional optimisation algorithm with generalised opposition-based learning. Int J Comput Sci Math 6(1):59\u201368","journal-title":"Int J Comput Sci Math"},{"key":"1912_CR15","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":"12","key":"1912_CR16","doi-asserted-by":"crossref","first-page":"5337","DOI":"10.1016\/j.eswa.2015.02.015","volume":"42","author":"X Kong","year":"2015","unstructured":"Kong X, Gao L, Ouyang H, Li S (2015) A simplified binary harmony search algorithm for large scale 0\u20131 knapsack problems. Expert Syst Appl 42(12):5337\u20135355","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1912_CR17","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"},{"issue":"1","key":"1912_CR18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s00500-012-0897-2","volume":"17","author":"D Manjarres","year":"2013","unstructured":"Manjarres D, Del Ser J, Gil-Lopez S, Vecchio M, Landa-Torres I, Lopez-Valcarce R (2013) A novel heuristic approach for distance-and connectivity-based multihop node localization in wireless sensor networks. Soft Comput 17(1):17\u201328","journal-title":"Soft Comput"},{"issue":"2","key":"1912_CR19","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.amc.2007.09.004","volume":"198","author":"Mahamed GH Omran","year":"2008","unstructured":"Omran Mahamed GH, Mahdavi Mehrdad (2008) Global-best harmony search. Appl Math Comput 198(2):643\u2013656","journal-title":"Appl Math Comput"},{"key":"1912_CR20","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1016\/j.amc.2014.09.071","volume":"247","author":"H-B Ou Yang","year":"2014","unstructured":"Ou Yang H-B, Gao L-Q, Li S, Kong X, Zou D-X (2014) On the iterative convergence of harmony search algorithm and a proposed modification. Appl Math Comput 247:1064\u20131095","journal-title":"Appl Math Comput"},{"key":"1912_CR21","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ins.2015.01.020","volume":"305","author":"H-B Ou Yang","year":"2015","unstructured":"Ou Yang H-B, Gao L-Q, Li S, Kong X-Y (2015) Improved novel global harmony search with a new relaxation method for reliability optimization problems. Inform Sci 305:14\u201355","journal-title":"Inform Sci"},{"issue":"3","key":"1912_CR22","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1016\/j.amc.2010.01.088","volume":"216","author":"Q-K Pan","year":"2010","unstructured":"Pan Q-K, Suganthan PN, Tasgetiren MF, Liang JJ (2010) A self-adaptive global best harmony search algorithm for continuous optimization problems. Appl Math Comput 216(3):830\u2013848","journal-title":"Appl Math Comput"},{"issue":"8","key":"1912_CR23","doi-asserted-by":"crossref","first-page":"5270","DOI":"10.1016\/j.asoc.2011.05.033","volume":"11","author":"Q-K Pan","year":"2011","unstructured":"Pan Q-K, Wang L, Gao L (2011) A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers. Appl Soft Comput 11(8):5270\u20135280","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1912_CR24","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TEVC.2007.894200","volume":"12","author":"S Rahnamayan","year":"2008","unstructured":"Rahnamayan S, Tizhoosh HR, Salama M (2008) Opposition-based differential evolution. IEEE Trans Evolut Comput 12(1):64\u201379","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"1912_CR25","doi-asserted-by":"crossref","first-page":"55","DOI":"10.3233\/JHS-140487","volume":"20","author":"S Sakamoto","year":"2014","unstructured":"Sakamoto S, Kulla E, Oda T, Ikeda M, Barolli L, Xhafa F (2014) A comparison study of hill climbing, simulated annealing and genetic algorithm for node placement problem in wmns. J High Speed Netw 20(1):55\u201366","journal-title":"J High Speed Netw"},{"key":"1912_CR26","doi-asserted-by":"crossref","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 ZW (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":"1912_CR27","first-page":"279","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 Appl Eng Technol 28(1):279\u2013290","journal-title":"J Intell Fuzzy Syst Appl Eng Technol"},{"issue":"8","key":"1912_CR28","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1007\/s00500-013-1167-7","volume":"18","author":"M Shivaie","year":"2014","unstructured":"Shivaie M, Ameli MT (2014) An implementation of improved harmony search algorithm for scenario-based transmission expansion planning. Soft Comput 18(8):1615\u20131630","journal-title":"Soft Comput"},{"key":"1912_CR29","doi-asserted-by":"crossref","unstructured":"Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: International conference on computational intelligence for modelling, control and automation, pp 695\u2013701","DOI":"10.1109\/CIMCA.2005.1631345"},{"key":"1912_CR30","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1016\/j.amc.2014.01.086","volume":"232","author":"E Valian","year":"2014","unstructured":"Valian E, Tavakoli S, Mohanna S (2014) An intelligent global harmony search approach to continuous optimization problems. Appl Math Comput 232:670\u2013684","journal-title":"Appl Math Comput"},{"issue":"4","key":"1912_CR31","doi-asserted-by":"crossref","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"},{"key":"1912_CR32","doi-asserted-by":"crossref","unstructured":"Wang H, Wu Z, Liu Y, Wang J, Jiang D, Chen L (2009) Space transformation search: a new evolutionary technique. In: Proceedings of the first ACM\/SIGEVO summit on genetic and evolutionary computation, pp 537\u2013544","DOI":"10.1145\/1543834.1543907"},{"issue":"20","key":"1912_CR33","doi-asserted-by":"crossref","first-page":"4699","DOI":"10.1016\/j.ins.2011.03.016","volume":"181","author":"H Wang","year":"2011","unstructured":"Wang H, Zhijian W, Rahnamayan S, Liu Y, Ventresca M (2011) Enhancing particle swarm optimization using generalized opposition-based learning. Inform Sci 181(20):4699\u20134714","journal-title":"Inform Sci"},{"key":"1912_CR34","doi-asserted-by":"crossref","unstructured":"Wang J, Wu Z, Wang H (2010) Hybrid differential evolution algorithm with chaos and generalized opposition-based learning. Adv Comput Intell 6382:103\u2013111","DOI":"10.1007\/978-3-642-16493-4_11"},{"key":"1912_CR35","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.ins.2012.12.043","volume":"232","author":"L Wang","year":"2013","unstructured":"Wang L, Yang R, Yin X, Niu Q, Pardalos PM, Fei M (2013) An improved adaptive binary harmony search algorithm. Inform Sci 232:58\u201387","journal-title":"Inform Sci"},{"key":"1912_CR36","doi-asserted-by":"crossref","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"},{"key":"1912_CR37","first-page":"170","volume":"365\u2013366","author":"HG Xia","year":"2013","unstructured":"Xia HG, Wang QZ, Gao LQ (2013) Opposition-based improved harmony search algorithm solve unconstrained optimization problems. Appl Mech Mater 365\u2013366:170\u2013173","journal-title":"Appl Mech Mater"},{"issue":"13","key":"1912_CR38","doi-asserted-by":"crossref","first-page":"5788","DOI":"10.1016\/j.eswa.2014.03.016","volume":"41","author":"W-L Xiang","year":"2014","unstructured":"Xiang W-L, An M-Q, Li Y-Z, He R-C, Zhang J-F (2014) An improved global-best harmony search algorithm for faster optimization. Expert Syst Appl 41(13):5788\u20135803","journal-title":"Expert Syst Appl"},{"key":"1912_CR39","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.ins.2011.12.035","volume":"196","author":"P Yadav","year":"2012","unstructured":"Yadav P, Kumar R, Panda SK, Chang CS (2012) An intelligent tuned harmony search algorithm for optimisation. Inform Sci 196:47\u201372","journal-title":"Inform Sci"},{"issue":"2","key":"1912_CR40","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82\u2013102","journal-title":"IEEE Trans Evol Comput"},{"issue":"7","key":"1912_CR41","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s00607-015-0456-7","volume":"97","author":"S Yu","year":"2015","unstructured":"Yu S, Zhu S, Ma Y, Mao D (2015) Enhancing firefly algorithm using generalized opposition-based learning. Computing 97(7):741\u2013754","journal-title":"Computing"},{"key":"1912_CR42","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.neucom.2014.12.072","volume":"155","author":"J Zhai","year":"2015","unstructured":"Zhai J, Gao L, Li S (2015) Robust pole assignment in a specified union region using harmony search algorithm. Neurocomputing 155:12\u201321","journal-title":"Neurocomputing"},{"key":"1912_CR43","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.asoc.2015.01.022","volume":"29","author":"B Zhang","year":"2015","unstructured":"Zhang B, Pan Q-K, Zhang X-L, Duan P-Y (2015) An effective hybrid harmony search-based algorithm for solving multidimensional knapsack problems. Appl Soft Comput 29:288\u2013297","journal-title":"Appl Soft Comput"},{"issue":"6","key":"1912_CR44","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1007\/s00500-014-1307-8","volume":"19","author":"L Zheng","year":"2015","unstructured":"Zheng L, Diao R, Shen Q (2015) Self-adjusting harmony search-based feature selection. Soft Comput 19(6):1567\u20131579","journal-title":"Soft Comput"},{"issue":"16","key":"1912_CR45","doi-asserted-by":"crossref","first-page":"3308","DOI":"10.1016\/j.neucom.2010.07.010","volume":"73","author":"D Zou","year":"2010","unstructured":"Zou D, Gao L, Jianhua W, Li S (2010) Novel global harmony search algorithm for unconstrained problems. Neurocomputing 73(16):3308\u20133318","journal-title":"Neurocomputing"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1912-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1912-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1912-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1912-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T03:47:04Z","timestamp":1718164024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1912-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,30]]},"references-count":45,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1912"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1912-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2015,10,30]]}}}