{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:34:42Z","timestamp":1763105682972,"version":"3.37.3"},"reference-count":35,"publisher":"Wiley","license":[{"start":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T00:00:00Z","timestamp":1575504000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100007446","name":"King Khalid University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007446","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2019,12,5]]},"abstract":"<jats:p>Genetic algorithms (GAs) are stochastic-based heuristic search techniques that incorporate three primary operators: selection, crossover, and mutation. These operators are supportive in obtaining the optimal solution for constrained optimization problems. Each operator has its own benefits, but selection of chromosomes is one of the most essential operators for optimal performance of the algorithms. In this paper, an improved genetic algorithm-based novel selection scheme, i.e., stairwise selection (SWS) is presented to handle the problems of exploration (population diversity) and exploitation (selection pressure). For its global performance, we compared with several other selection schemes by using ten well-known benchmark functions under various dimensions. For a close comparison, we also examined the significance of SWS based on the statistical results. Chi-square goodness of fit test is also used to evaluate the overall performance of the selection process, i.e., mean difference between observed and expected number of offspring. Hence, the overall empirical results along with graphical representation endorse that the SWS outperformed in terms of robustness, stability, and effectiveness other competitors through authentication of performance index (PI).<\/jats:p>","DOI":"10.1155\/2019\/8640218","type":"journal-article","created":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T18:31:42Z","timestamp":1575570702000},"page":"1-14","source":"Crossref","is-referenced-by-count":26,"title":["A Novel Selection Approach for Genetic Algorithms for Global Optimization of Multimodal Continuous Functions"],"prefix":"10.1155","volume":"2019","author":[{"given":"Ehtasham-ul","family":"Haq","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, International Islamic University, Islamabad, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1124-7485","authenticated-orcid":true,"given":"Ishfaq","family":"Ahmad","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, International Islamic University, Islamabad, Pakistan"},{"name":"Department of Mathematics, King Khalid University, 61413 Abha, Saudi Arabia"},{"name":"Statistical Research and Studies Support Unit, King Khalid University, 61413 Abha, Saudi Arabia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4141-0359","authenticated-orcid":true,"given":"Abid","family":"Hussain","sequence":"additional","affiliation":[{"name":"Department of Statistics, Quaid-i-Azam University, Islamabad, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4651-3210","authenticated-orcid":true,"given":"Ibrahim M.","family":"Almanjahie","sequence":"additional","affiliation":[{"name":"Department of Mathematics, King Khalid University, 61413 Abha, Saudi Arabia"},{"name":"Statistical Research and Studies Support Unit, King Khalid University, 61413 Abha, Saudi Arabia"}]}],"member":"311","reference":[{"year":"1992","key":"1"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jestch.2016.08.003"},{"first-page":"15","volume-title":"Genetic algorithms","year":"2008","key":"3"},{"issue":"1","key":"4","first-page":"132","volume":"8","year":"2010","journal-title":"International Journal of Computer Science and Information Security"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.02.001"},{"year":"1998","key":"6"},{"volume":"12","year":"2012","key":"8"},{"issue":"6","key":"9","first-page":"4943","volume":"27","year":"2015","journal-title":"Science International"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/72.265964"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/474805"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.3390\/technologies7020030"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.3390\/math7030222"},{"issue":"2","key":"19","first-page":"56","volume":"15","year":"1993","journal-title":"University Computing"},{"volume":"3","journal-title":"International Journal of Engineering Science and Technology","year":"2011","key":"20"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.3390\/pr7060362"},{"year":"1996","key":"22"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1162\/106365601750190424"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/21.286385"},{"first-page":"1","volume-title":"An overview of predictive learning and function approximation","year":"1994","key":"25"},{"issue":"4","key":"26","first-page":"41","volume-title":"An efficient genetic algorithm for numerical function optimization with two new crossover operators","volume":"4","year":"2018"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1108\/02644401211235834"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.03.067"},{"year":"2013","key":"29"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.03.007"},{"first-page":"191","volume-title":"Parameter adaptation in ant colony optimization","year":"2011","key":"33"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-011-9276-0"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.01.056"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/j.scient.2012.12.005"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.10.015"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.04.005"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/6357935"},{"issue":"7","key":"42","doi-asserted-by":"crossref","first-page":"182","DOI":"10.4156\/jdcta.vol5.issue7.23","volume":"5","year":"2011","journal-title":"International Journal of Digital Content Technology and Its Applications"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1023\/a:1008761113491"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2013.05.005"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/8640218.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/8640218.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/8640218.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T18:31:51Z","timestamp":1575570711000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/cin\/2019\/8640218\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,5]]},"references-count":35,"alternative-id":["8640218","8640218"],"URL":"https:\/\/doi.org\/10.1155\/2019\/8640218","relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"type":"print","value":"1687-5265"},{"type":"electronic","value":"1687-5273"}],"subject":[],"published":{"date-parts":[[2019,12,5]]}}}