{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T09:18:35Z","timestamp":1759483115635,"version":"3.40.5"},"reference-count":46,"publisher":"Wiley","license":[{"start":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T00:00:00Z","timestamp":1573689600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&D plan","award":["2018YFD0300105"],"award-info":[{"award-number":["2018YFD0300105"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2019,11,14]]},"abstract":"<jats:p>A multi-offspring improved real-coded genetic algorithm (MOIRCGA) using the heuristical normal distribution and direction-based crossover (HNDDBX) is proposed to solve constrained optimization problems. Firstly, a HNDDBX operator is proposed. It guarantees the cross-generated offsprings are located near the better individuals in the population. In this way, the HNDDBX operator ensures that there is a great chance of generating better offsprings. Secondly, as iterations increase, the same individuals are likely to appear in the population. Therefore, it is possible that the two parents of participation crossover are the same. Under these circumstances, the crossover operation does not generate new individuals, and therefore does not work. To avoid this problem, the substitution operation is added after the crossover so that there is no duplication of the same individuals in the population. This improves the computational efficiency of MOIRCGA by leading it to quickly converge to the global optimal solution. Finally, aiming at the shortcoming of a single mutation operator which cannot simultaneously take into account local search and global search, a Combinational Mutation method is proposed with both local search and global search. The experimental results with sixteen examples show that the multi-offspring improved real-coded genetic algorithm (MOIRCGA) has fast convergence speed. As an example, the optimization model of the cantilevered beam structure is formulated, and the proposed MOIRCGA is compared to the RCGA in optimizing the parameters of the cantilevered beam structure. The optimization results show that the function value obtained with the proposed MOIRCGA is superior to that of RCGA.<\/jats:p>","DOI":"10.1155\/2019\/4243853","type":"journal-article","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T18:30:44Z","timestamp":1573756244000},"page":"1-17","source":"Crossref","is-referenced-by-count":15,"title":["An Improved Real-Coded Genetic Algorithm Using the Heuristical Normal Distribution and Direction-Based Crossover"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1498-2602","authenticated-orcid":true,"given":"Jiquan","family":"Wang","sequence":"first","affiliation":[{"name":"College of Engineering, Northeast Agricultural University, Harbin, Heilongjiang 150030, China"}]},{"given":"Mingxin","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Engineering, Northeast Agricultural University, Harbin, Heilongjiang 150030, China"}]},{"given":"Okan K.","family":"Ersoy","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47907-1285, USA"}]},{"given":"Kexin","family":"Sun","sequence":"additional","affiliation":[{"name":"College of Engineering, Northeast Agricultural University, Harbin, Heilongjiang 150030, China"}]},{"given":"Yusheng","family":"Bi","sequence":"additional","affiliation":[{"name":"College of Engineering, Northeast Agricultural University, Harbin, Heilongjiang 150030, China"}]}],"member":"311","reference":[{"year":"1975","key":"1"},{"issue":"8","key":"2","first-page":"1959","volume":"26","year":"2006","journal-title":"Computer Applications"},{"issue":"4","key":"3","first-page":"390","volume":"33","year":"2013","journal-title":"Journal of Beijing Institute of Technology"},{"issue":"4","key":"4","first-page":"140","volume":"28","year":"2011","journal-title":"Microelectronics and Computers"},{"issue":"2","key":"5","first-page":"164","volume":"22","year":"2007","journal-title":"Control and Decision"},{"issue":"4","key":"7","first-page":"765","volume":"20","year":"2012","journal-title":"Journal of Software"},{"issue":"7","key":"8","first-page":"843","volume":"27","year":"2010","journal-title":"Control Theory and Applications"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.5860\/choice.27-0936"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.07.019"},{"issue":"4","key":"13","doi-asserted-by":"crossref","first-page":"765","DOI":"10.3724\/SP.J.1001.2012.04040","volume":"23","year":"2012","journal-title":"Journal of Software"},{"issue":"7","key":"14","first-page":"843","volume":"27","year":"2010","journal-title":"Control Theory & Applications"},{"key":"15","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/TCAPT.2008.916855","volume":"31","year":"2008","journal-title":"IEEE Transactions on Components, Packaging, and Manufacturing Technology"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TSM.2009.2039186"},{"key":"17","doi-asserted-by":"crossref","first-page":"4710","DOI":"10.1016\/j.amc.2011.07.038","volume":"218","year":"2012","journal-title":"Applied Mathematics and Computation"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2009.2037620"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2008.11.006"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/9270802"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-015-2476-x"},{"issue":"22","key":"22","first-page":"3405","volume":"5","year":"2010","journal-title":"Scientific Research and Essays"},{"first-page":"187","volume-title":"Real-coded genetic algorithms and interval-schemata","year":"1993","key":"23"},{"year":"1989","key":"24"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/0888-613x(94)00033-y"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771166"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.09.036"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.08.035"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.10.019"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1370-4"},{"volume-title":"Genetic algorithms for real parameter optimization","year":"1991","key":"32"},{"key":"33","first-page":"115","volume":"9","year":"1995","journal-title":"Complex Systems"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760972767"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.10.047"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/5760841"},{"year":"1996","key":"38"},{"issue":"4","key":"40","first-page":"446","volume":"11","year":"1996","journal-title":"Control and Decision"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1504\/IJAISC.2014.059280"},{"issue":"2","key":"42","first-page":"305","volume":"30","year":"2015","journal-title":"Journal of Biomathematics"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.02.021"},{"issue":"3","key":"44","first-page":"72","volume":"47","year":"2016","journal-title":"Journal of Northeast Agricultural University"},{"year":"2018","key":"45"},{"issue":"5","key":"46","first-page":"625","volume":"17","year":"2002","journal-title":"Control and Decision"},{"issue":"20","key":"47","first-page":"57","volume":"45","year":"2009","journal-title":"Journal of Computer Engineering and Applications"},{"issue":"10","key":"48","first-page":"58","volume":"49","year":"2013","journal-title":"Journal of Computer Engineering and Applications"},{"key":"49","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.49.4677"},{"key":"50","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.11.041"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.12.046"},{"issue":"11","key":"52","first-page":"118","volume":"47","year":"2017","journal-title":"Mathematics in Practice and Theory"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/4243853.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/4243853.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/4243853.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T18:30:58Z","timestamp":1573756258000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/cin\/2019\/4243853\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,14]]},"references-count":46,"alternative-id":["4243853","4243853"],"URL":"https:\/\/doi.org\/10.1155\/2019\/4243853","relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"type":"print","value":"1687-5265"},{"type":"electronic","value":"1687-5273"}],"subject":[],"published":{"date-parts":[[2019,11,14]]}}}