{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:47:36Z","timestamp":1762624056213,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2018,8,12]],"date-time":"2018-08-12T00:00:00Z","timestamp":1534032000000},"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":["Soft Comput"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00500-018-3437-x","type":"journal-article","created":{"date-parts":[[2018,8,12]],"date-time":"2018-08-12T05:40:19Z","timestamp":1534052419000},"page":"7991-8011","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Hybridization of water wave optimization and sequential quadratic programming for cognitive radio system"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7841-5394","authenticated-orcid":false,"given":"Gurmukh","family":"Singh","sequence":"first","affiliation":[]},{"given":"Munish","family":"Rattan","sequence":"additional","affiliation":[]},{"given":"Sandeep Singh","family":"Gill","sequence":"additional","affiliation":[]},{"given":"Nitin","family":"Mittal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,12]]},"reference":[{"key":"3437_CR1","volume-title":"Handbook of mathematical functions, with formulas, graphs, and mathematical tables","author":"M Abramowitz","year":"1974","unstructured":"Abramowitz M (1974) Handbook of mathematical functions, with formulas, graphs, and mathematical tables. Dover Publications, Inc., New York, NY, USA"},{"key":"3437_CR2","unstructured":"Back T, Hoffmeister F, Schwefel HP (1991) A survey of evolution strategies. In: Proceedings of the fourth international conference on genetic algorithms"},{"key":"3437_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0377-0427(00)00429-5","volume":"124","author":"T Boggs","year":"2000","unstructured":"Boggs T, Tolle JW (2000) Sequential quadratic programming for large-scale nonlinear optimization. J Comput Appl Math 124:123\u2013137","journal-title":"J Comput Appl Math"},{"issue":"5","key":"3437_CR4","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TEVC.2011.2132725","volume":"15","author":"X Chen","year":"2011","unstructured":"Chen X, Ong YS, Lim MH, Tan KC (2011) A multi-facet survey on memetic computation. IEEE Trans Evol Comput 15(5):591\u2013607","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"3437_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the travelling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"3437_CR6","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32:674\u2013701","journal-title":"J Am Stat Assoc"},{"key":"3437_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11:86\u201392","journal-title":"Ann Math Stat"},{"key":"3437_CR8","isbn-type":"print","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA. ISBN 0201157675","ISBN":"https:\/\/id.crossref.org\/isbn\/0201157675"},{"issue":"4","key":"3437_CR9","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s00500-010-0591-1","volume":"15","author":"W Gong","year":"2010","unstructured":"Gong W, Cai Z, Ling CX (2010) DE\/BBO: a hybrid differential evolution with biogeography- based optimization for global numerical optimization. Soft Comput 15(4):645\u2013665","journal-title":"Soft Comput"},{"issue":"8","key":"3437_CR10","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.4304\/jcp.8.8.2077-2084","volume":"8","author":"H Huang","year":"2013","unstructured":"Huang H, Ding S, Zhu H, Xu X (2013) Invasive weed optimization algorithm for optimizing the parameters of mixed Kernel twin support vector machines. J Comput 8(8):2077\u20132084","journal-title":"J Comput"},{"key":"3437_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.07.023","author":"F Javidrad","year":"2017","unstructured":"Javidrad F, Nazari M (2017) A new hybrid particle swarm and simulated annealing stochastic optimization method. Appl Soft Comput. \n                              https:\/\/doi.org\/10.1016\/j.asoc.2017.07.023","journal-title":"Appl Soft Comput"},{"key":"3437_CR12","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.energy.2016.05.105","volume":"111","author":"T Jayabarathi","year":"2016","unstructured":"Jayabarathi T, Raghunathan T, Adarsh BR, Suganthan PN (2016) Economic dispatch using hybrid grey wolf optimizer. Energy 111:630\u2013641","journal-title":"Energy"},{"issue":"1","key":"3437_CR13","first-page":"108","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","journal-title":"Appl Math Comput"},{"issue":"1","key":"3437_CR14","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1080\/00207217.2013.769183","volume":"101","author":"K Kaur","year":"2013","unstructured":"Kaur K, Rattan M (2013) Biogeography based optimization of cognitive radio system. Int J Electron 101(1):24\u201336","journal-title":"Int J Electron"},{"key":"3437_CR15","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1007\/s11277-012-0874-1","volume":"71","author":"K Kaur","year":"2013","unstructured":"Kaur K, Rattan M, Patterh MS (2013) Optimization of cognitive radio system using simulated annealing. Wirel Pers Commun 71:1283\u20131296. \n                              https:\/\/doi.org\/10.1007\/s11277-012-0874-1","journal-title":"Wirel Pers Commun"},{"key":"3437_CR16","first-page":"1942","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. IEEE Int Conf Neural Netw 4:1942\u20131948","journal-title":"IEEE Int Conf Neural Netw"},{"key":"3437_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.engappai.2017.05.017","volume":"64","author":"G Khademi","year":"2017","unstructured":"Khademi G, Mohammadi H, Simon D (2017) Hybrid invasive weed\/biogeography-based optimization. Eng Appl Artif Intell 64:213\u2013231","journal-title":"Eng Appl Artif Intell"},{"key":"3437_CR18","volume-title":"Genetic programming: on the programming of computers by natural selection","author":"JR Koza","year":"1992","unstructured":"Koza JR (1992) Genetic programming: on the programming of computers by natural selection. MIT Press, Cambridge"},{"key":"3437_CR19","doi-asserted-by":"publisher","first-page":"8881","DOI":"10.1016\/j.eswa.2015.07.043","volume":"42","author":"Z Li","year":"2015","unstructured":"Li Z (2015) PS-ABC: a hybrid algorithm based on particle swarm and artificial bee colony for high-dimensional optimization problems. Expert Syst Appl (Sci Direct) 42:8881\u20138895","journal-title":"Expert Syst Appl (Sci Direct)"},{"key":"3437_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s12190-012-0549-9","volume":"40","author":"M Liu","year":"2012","unstructured":"Liu M, Li X, Pu D (2012) A feasible filter SQP algorithm with global and local convergence. J Appl Math Comput 40:261\u2013275","journal-title":"J Appl Math Comput"},{"key":"3437_CR21","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.neucom.2017.04.053","volume":"260","author":"MM Mafarja","year":"2017","unstructured":"Mafarja MM, Mirjalili S (2017) Hybrid whale optimization algorithm with simulated annealing for feature selection. Neurocomputing 260:302\u2013312","journal-title":"Neurocomputing"},{"issue":"4","key":"3437_CR22","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.ecoinf.2006.07.003","volume":"1","author":"AR Mehrabian","year":"2006","unstructured":"Mehrabian AR, Lucas C (2006) A novel numerical optimization algorithm inspired from weed colonization. Ecol Inf 1(4):355\u2013366","journal-title":"Ecol Inf"},{"key":"3437_CR23","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl Based Syst 89:228\u2013249","journal-title":"Knowl Based Syst"},{"key":"3437_CR24","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367","journal-title":"Adv Eng Softw"},{"key":"3437_CR25","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.engappai.2018.03.003","volume":"71","author":"A Mortazavi","year":"2018","unstructured":"Mortazavi A, To\u011fan V, Nuho\u011flu A (2018) Interactive search algorithm: a new hybrid metaheuristic optimization algorithm. Eng Appl Artif Intell 71:275\u2013292","journal-title":"Eng Appl Artif Intell"},{"key":"3437_CR26","first-page":"213","volume":"826","author":"P Moscato","year":"1989","unstructured":"Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards Memetic Algorithms. Caltech Concurr Comput Progr Rep 826:213\u2013218","journal-title":"Caltech Concurr Comput Progr Rep"},{"issue":"6","key":"3437_CR27","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1007\/s00500-015-1642-4","volume":"20","author":"J Nalepa","year":"2016","unstructured":"Nalepa J, Blocho M (2016) Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput 20(6):2309\u20132327","journal-title":"Soft Comput"},{"key":"3437_CR28","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.neucom.2015.12.046","volume":"185","author":"J Nalepa","year":"2016","unstructured":"Nalepa J, Kawulok M (2016) Adaptive memetic algorithm enhanced with data geometry analysis to select training data for SVMs. Neurocomputing 185:113\u2013132","journal-title":"Neurocomputing"},{"key":"3437_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: a literature review. Swarm Evolut Comput 2:1\u201314","journal-title":"Swarm Evolut Comput"},{"key":"3437_CR30","unstructured":"Paraskevopoulos A (2015) Optimization of cognitive radio systems using nature inspired algorithms. In: 4th international conference on modern circuits and systems technologies, vol 7, pp 213\u2013217"},{"key":"3437_CR31","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao RV, Savsani VJ, Vakharia DP (2011) Teaching\u2013learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43:303\u2013315","journal-title":"Comput Aided Des"},{"key":"3437_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.04.010","author":"A Sadollah","year":"2018","unstructured":"Sadollah A, Sayyaadi H, Yoo DG, Lee HM, Kim JH (2018) Mine blast harmony search: a new hybrid optimization method for improving exploration and exploitation capabilities. Appl Soft Comput J. \n                              https:\/\/doi.org\/10.1016\/j.asoc.2018.04.010","journal-title":"Appl Soft Comput J"},{"issue":"6","key":"3437_CR34","first-page":"1","volume":"23","author":"N Siddique","year":"2014","unstructured":"Siddique N, Adeli H (2014) Water Drop Algorithms. Int J Artif Intell Tools 23(6):1\u201322","journal-title":"Int J Artif Intell Tools"},{"issue":"6","key":"3437_CR35","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702\u2013713","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"3437_CR36","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TSMCB.2006.883273","volume":"37","author":"JE Smith","year":"2007","unstructured":"Smith JE (2007) Coevolving memetic algorithms: a review and progress report. IEEE Trans Syst Man Cybernet Part B (Cybernet) 37(1):6\u201317","journal-title":"IEEE Trans Syst Man Cybernet Part B (Cybernet)"},{"key":"3437_CR37","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11:341\u2013359","journal-title":"J Global Optim"},{"key":"3437_CR38","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.epsr.2003.12.017","volume":"71","author":"TAA Victoire","year":"2004","unstructured":"Victoire TAA, Jeyakumar AE (2004) Hybrid PSO\u2013SQP for economic dispatch with valve-point effect. Electr Power Syst Res 71:51\u201359","journal-title":"Electr Power Syst Res"},{"issue":"10","key":"3437_CR39","doi-asserted-by":"publisher","first-page":"2312","DOI":"10.1166\/jctn.2013.3207","volume":"10","author":"G Wang","year":"2013","unstructured":"Wang G, Guo L, Duan H, Wang H, Liu L, Shao M (2013) Hybridizing harmony search with biogeography based optimization for global numerical optimization. J Comput Theor Nanosci 10(10):2312\u20132322","journal-title":"J Comput Theor Nanosci"},{"key":"3437_CR40","first-page":"2776","volume":"29","author":"Y Wanga","year":"2012","unstructured":"Wanga Y, Zhang Z, Li F, Chen J (2012) A novel spectrum allocation algorithm for cognitive radio networks. Int Workshop Inf Electron Eng 29:2776\u20132780","journal-title":"Int Workshop Inf Electron Eng"},{"issue":"2","key":"3437_CR41","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1504\/IJBIC.2010.032124","volume":"2","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Firefly algorithm, stochastic test functions and design optimization. Int J Bio Inspired Comput 2(2):78\u201384","journal-title":"Int J Bio Inspired Comput"},{"issue":"4","key":"3437_CR42","first-page":"330","volume":"1","author":"XS Yang","year":"2010","unstructured":"Yang XS, 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":"3437_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2014.10.008","volume":"55","author":"YJ Zheng","year":"2015","unstructured":"Zheng YJ (2015) Water wave optimization: a new nature-inspired metaheuristic. Comput Oper Res 55:1\u201311","journal-title":"Comput Oper Res"},{"key":"3437_CR44","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s001860300299","volume":"58","author":"Z Zhu","year":"2003","unstructured":"Zhu Z, Zhang K, Jian J (2003) An improved SQP algorithm for inequality constrained optimization. Math Methods Oper Res 58:271\u2013282","journal-title":"Math Methods Oper Res"},{"key":"3437_CR45","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.aml.2008.06.017","volume":"22","author":"Z Zhu","year":"2009","unstructured":"Zhu Z, Cai X, Jian J (2009) An improved SQP algorithm for solving minimax problems. Appl Math Lett 22:464\u2013469","journal-title":"Appl Math Lett"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3437-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3437-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3437-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T19:11:42Z","timestamp":1565550702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3437-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,12]]},"references-count":44,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["3437"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3437-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,8,12]]},"assertion":[{"value":"12 August 2018","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"}}]}}