{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T03:49:27Z","timestamp":1762660167486},"reference-count":65,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,31]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The main aim of this article is to explore the real-life problem-solving potential of the proposed L\u00e9vy flight-based chaotic gravitational search algorithm (LCGSA) for the minimization of engineering design variables of speed reducer design (SRD), three bar truss design (TBTD), and hydrodynamic thrust bearing design (HTBD) problems. In LCGSA, the diversification of the search space is carried out by L\u00e9vy flight distribution. Simultaneously, chaotic maps have been utilized for the intensification of the candidate solutions towards the global optimum. Moreover, the penalty function method has been used to deal with the non-linear and fractional design constraints. The investigation of experimental outcomes has been performed through various performance metrics like statistical measures, run time analysis, convergence rate, and box plot analysis. Moreover, statistical verification of experimental results is carried out using a signed Wilcoxon rank-sum test. Furthermore, eleven heuristic algorithms were employed for comparative analysis of the simulation results. The simulation outcomes clearly show that LCGSA provides better values for TBTD and HTBD benchmarks than standard GSA and most of the competing algorithms. Besides, all the participating algorithms, including LCGSA, have the same results for the SRD problem. On the qualitative side, LCGSA has successfully resolved entrapment in local minima and convergence issues of standard GSA.<\/jats:p>","DOI":"10.1515\/comp-2020-0223","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T22:05:44Z","timestamp":1643753144000},"page":"509-529","source":"Crossref","is-referenced-by-count":8,"title":["L\u00e9vy flight and chaos theory-based gravitational search algorithm for mechanical and structural engineering design optimization"],"prefix":"10.1515","volume":"11","author":[{"given":"Sajad Ahmad","family":"Rather","sequence":"first","affiliation":[{"name":"Department of Computer Science, School of Engineering and Technology, Pondicherry University , Puducherry-605014 , India"}]},{"given":"Perumal Shanthi","family":"Bala","sequence":"additional","affiliation":[{"name":"Department of Computer Science, School of Engineering and Technology, Pondicherry University , Puducherry-605014 , India"}]}],"member":"374","published-online":{"date-parts":[[2021,12,31]]},"reference":[{"key":"2022020121511031635_j_comp-2020-0223_ref_001","doi-asserted-by":"crossref","unstructured":"A. E. Eiben and C. A. Schippers, \u201cOn evolutionary diversification and intensification,\u201d Fund. Inform., vol. 35, no. 1. pp. 35\u201350, 1998.","DOI":"10.3233\/FI-1998-35123403"},{"key":"2022020121511031635_j_comp-2020-0223_ref_002","doi-asserted-by":"crossref","unstructured":"D. H. Wolpert and W. G. Macready, \u201cNo free lunch theorems for optimization,\u201d IEEE Trans. Evol. Comput., vol. 1, no. 1. pp. 67\u201382, 1997.","DOI":"10.1109\/4235.585893"},{"key":"2022020121511031635_j_comp-2020-0223_ref_003","doi-asserted-by":"crossref","unstructured":"J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, New York: MIT Press, 1992.","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"2022020121511031635_j_comp-2020-0223_ref_004","unstructured":"R. Eberhart and J. Kennedy, \u201cA new optimizer using particle swarm theory,\u201d 6th IEEE International Symposium on Micro Machine and Human Science (MHS \u201895), 1995."},{"key":"2022020121511031635_j_comp-2020-0223_ref_005","doi-asserted-by":"crossref","unstructured":"M. Dorigo, M. Birattari, and T. Stutzle, \u201cAnt colony optimization,\u201d IEEE Comput. Intell. Mag., vol. 1, no. 4. pp. 28\u201339, 2006.","DOI":"10.1109\/CI-M.2006.248054"},{"key":"2022020121511031635_j_comp-2020-0223_ref_006","doi-asserted-by":"crossref","unstructured":"R. Storn and K. Price, \u201cDifferential evolution\u2010a simple and efficient heuristic for global optimization over continuous spaces,\u201d J. Glob. Optim., vol. 11, no. 4. pp. 341\u2013359, 1997.","DOI":"10.1023\/A:1008202821328"},{"key":"2022020121511031635_j_comp-2020-0223_ref_007","doi-asserted-by":"crossref","unstructured":"D. Simon, \u201cBiogeography\u2010based optimization,\u201d IEEE Trans. Evol. Comput., vol. 12, pp. 702\u2013713, 2008.","DOI":"10.1109\/TEVC.2008.919004"},{"key":"2022020121511031635_j_comp-2020-0223_ref_008","doi-asserted-by":"crossref","unstructured":"S. Mirjalili, S. M. Mirjalili, and A. Lewis, \u201cGrey wolf optimizer,\u201d Adv. Eng. Softw., vol. 69, pp. 46\u201361, 2014.","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"2022020121511031635_j_comp-2020-0223_ref_009","doi-asserted-by":"crossref","unstructured":"S. Mirjalili, \u201cThe ant lion optimizer,\u201d Adv. Eng. Softw., vol. 83, pp. 80\u201398, 2015.","DOI":"10.1016\/j.advengsoft.2015.01.010"},{"key":"2022020121511031635_j_comp-2020-0223_ref_010","doi-asserted-by":"crossref","unstructured":"S. Mirjalili, \u201cSCA: a sine cosine algorithm for solving optimization problems,\u201d Knowl. Based Syst., vol. 96, pp. 120\u2013133, 2016.","DOI":"10.1016\/j.knosys.2015.12.022"},{"key":"2022020121511031635_j_comp-2020-0223_ref_011","doi-asserted-by":"crossref","unstructured":"S. Mirjalili, A. H. Gandomi, S. Z. Mirjalili, S. Saremi, H. Faris, and S. M. Mirjalili, \u201cSalp swarm algorithm: a bio-inspired optimizer for engineering design problems,\u201d Adv. Eng. Softw., vol. 114, pp. 163\u2013191, 2017.","DOI":"10.1016\/j.advengsoft.2017.07.002"},{"key":"2022020121511031635_j_comp-2020-0223_ref_012","doi-asserted-by":"crossref","unstructured":"L. Cheng, X. H. Wu, and Y. Wang, \u201cArtificial flora (AF) optimization algorithm,\u201d Appl. Sci., vol. 8, no. 3. pp. 1\u201322, 2018.","DOI":"10.3390\/app8030329"},{"key":"2022020121511031635_j_comp-2020-0223_ref_013","doi-asserted-by":"crossref","unstructured":"A. Shabani, B. Asgarian, S. A. Gharebaghi, M. A. Salido, and A. Giret, \u201cA new optimization algorithm based on search and rescue operations,\u201d Math. Probl. Eng., vol. 2019, pp. 1\u201323, 2019, 10.1155\/2019\/2482543.","DOI":"10.1155\/2019\/2482543"},{"key":"2022020121511031635_j_comp-2020-0223_ref_014","doi-asserted-by":"crossref","unstructured":"V. Hayyolalam and A. A. Kazem, \u201cBlack Widow optimization algorithm: a novel meta-heuristic approach for solving engineering optimization problems,\u201d Eng. Appl. Artif. Intell., vol. 87, pp. 103\u2013249, 2020.","DOI":"10.1016\/j.engappai.2019.103249"},{"key":"2022020121511031635_j_comp-2020-0223_ref_015","doi-asserted-by":"crossref","unstructured":"A. M. Ahmed, T. A. Rashid, and S. A. Saeed, \u201cCat swarm optimization algorithm: a survey and performance evaluation,\u201d Comput. Intell. Neurosci., vol. 2020, pp. 1\u201320, 2020, 10.1155\/2020\/4854895.","DOI":"10.1155\/2020\/4854895"},{"key":"2022020121511031635_j_comp-2020-0223_ref_016","doi-asserted-by":"crossref","unstructured":"M. H. Sulaiman, Z. Mustaffa, M. M. Saari, and H. Daniyal, \u201cBarnacles mating optimizer: A new bio-inspired algorithm for solving engineering optimization problems,\u201d Eng. Appl. Artif. Intell., vol. 87, pp. 103\u2013330, 2020.","DOI":"10.1016\/j.engappai.2019.103330"},{"key":"2022020121511031635_j_comp-2020-0223_ref_017","doi-asserted-by":"crossref","unstructured":"S. A. Rather and P. S. Bala, \u201cAnalysis of gravitation-based optimization algorithms for clustering and classification,\u201d Handbook of Research on Big Data Clustering and Machine Learning, G. M. Pedro, ed., New York, NY, IGI Global, 2020a, pp. 77\u201399. 10.4018\/978-1-7998-0106-1.ch005.","DOI":"10.4018\/978-1-7998-0106-1.ch005"},{"key":"2022020121511031635_j_comp-2020-0223_ref_018","doi-asserted-by":"crossref","unstructured":"S. A. Rather and P. S. Bala, \u201cSwarm-based chaotic gravitational search algorithm for solving mechanical engineering design problems,\u201d World J. Eng., vol. 17, no. 1. pp. 97\u2013114, 2020b.","DOI":"10.1108\/WJE-09-2019-0254"},{"key":"2022020121511031635_j_comp-2020-0223_ref_019","doi-asserted-by":"crossref","unstructured":"S. Mirjalili and A. H. Gandomi, \u201cChaotic gravitational constants for the gravitational search algorithm,\u201d Appl. Soft Comput., vol. 53, pp. 407\u2013419, 2017.","DOI":"10.1016\/j.asoc.2017.01.008"},{"key":"2022020121511031635_j_comp-2020-0223_ref_020","doi-asserted-by":"crossref","unstructured":"A. H. Gandomi, G. J. Yun, X. S. Yang, and S. Talatahari, \u201cChaos-enhanced accelerated particle swarm optimization,\u201d Commun. Nonlinear Sci. Numer. Simul., vol. 18, pp. 327\u2013340, 2013.","DOI":"10.1016\/j.cnsns.2012.07.017"},{"key":"2022020121511031635_j_comp-2020-0223_ref_021","doi-asserted-by":"crossref","unstructured":"D. Shen, T. Jiang, W. Chen, Q. Shi, and S. Gao, \u201cImproved chaotic gravitational search algorithms for global optimization,\u201d IEEE Congress on Evolutionary Computation (CEC), New York: IEEE, 2015, pp. 1220\u20131226, 10.1109\/CEC.2015.7257028.","DOI":"10.1109\/CEC.2015.7257028"},{"key":"2022020121511031635_j_comp-2020-0223_ref_022","doi-asserted-by":"crossref","unstructured":"M. A. Basset, G. G. Wang, A. K. Sangaiah, and E. Rushdy, \u201cKrill herd algorithm based on cuckoo search for solving engineering optimization problems,\u201d Multimed. Tools Appl., vol. 78, no. 4. pp. 3861\u20133884, 2019, 10.1007\/s11042-017-4803-x.","DOI":"10.1007\/s11042-017-4803-x"},{"key":"2022020121511031635_j_comp-2020-0223_ref_023","doi-asserted-by":"crossref","unstructured":"R. G. Rodenas, L. J. Linares, and J. A. L. Gomez, \u201cA memetic chaotic gravitational search algorithm for unconstrained global optimization problems,\u201d Appl. Soft Comput., vol. 79, pp. 14\u201329, 2019.","DOI":"10.1016\/j.asoc.2019.03.011"},{"key":"2022020121511031635_j_comp-2020-0223_ref_024","doi-asserted-by":"crossref","unstructured":"T. A. Khan and S. H. Ling, \u201cAn improved gravitational search algorithm for solving an electromagnetic design problem,\u201d J. Comput. Electron., vol. 19, pp. 1\u20137, 2020.","DOI":"10.1007\/s10825-020-01476-8"},{"key":"2022020121511031635_j_comp-2020-0223_ref_025","doi-asserted-by":"crossref","unstructured":"S. Jiang, C. Zhang, and S. Chen, \u201cSequential hybrid particle swarm optimization and gravitational search algorithm with dependent random coefficients,\u201d Math. Probl. Eng., vol. 2020, pp. 1\u201317,  2020, 10.1155\/2020\/1957812.","DOI":"10.1155\/2020\/1957812"},{"key":"2022020121511031635_j_comp-2020-0223_ref_026","doi-asserted-by":"crossref","unstructured":"F. Barani, M. Mirhosseini, and H. Nezamabadi-Pour, \u201cApplication of binary quantum-inspired gravitational search algorithm in feature subset selection,\u201d Appl. Intell., vol. 47, no. 2. pp. 304\u2013318, 2017.","DOI":"10.1007\/s10489-017-0894-3"},{"key":"2022020121511031635_j_comp-2020-0223_ref_027","doi-asserted-by":"crossref","unstructured":"D. Pelusi, R. Mascella, and L. Tallini, \u201cA fuzzy gravitational search algorithm to design optimal IIR filters,\u201d Energies, vol. 11, no. 4. p. 736, 2018.","DOI":"10.3390\/en11040736"},{"key":"2022020121511031635_j_comp-2020-0223_ref_028","doi-asserted-by":"crossref","unstructured":"P. Haghbayan, H. Nezamabadi-Pour, and S. Kamyab, \u201cA niche GSA method with nearest neighbor scheme for multimodal optimization,\u201d Swarm Evol. Comput., vol. 35, pp. 78\u201392, 2017.","DOI":"10.1016\/j.swevo.2017.03.002"},{"key":"2022020121511031635_j_comp-2020-0223_ref_029","doi-asserted-by":"crossref","unstructured":"S. Yazdani, H. Nezamabadi-pour, and S. Kamyab, \u201cA gravitational search algorithm for multimodal optimization,\u201d Swarm Evol. Comput., vol. 14, pp. 1\u201314, 2014, 10.1016\/j.swevo.2013.08.001.","DOI":"10.1016\/j.swevo.2013.08.001"},{"key":"2022020121511031635_j_comp-2020-0223_ref_030","doi-asserted-by":"crossref","unstructured":"K. Kang, C. Bae, H. W. F. Yeung, and Y. Y. Chung, \u201cA hybrid gravitational search algorithm with swarm intelligence and deep convolutional feature for object tracking optimization,\u201d Appl. Soft Comput., vol. 66, pp. 319\u2013329, 2018.","DOI":"10.1016\/j.asoc.2018.02.037"},{"key":"2022020121511031635_j_comp-2020-0223_ref_031","doi-asserted-by":"crossref","unstructured":"F. Khajooei and E. Rashedi, A new version of Gravitational Search Algorithm with negative mass, Proceedings of 1st IEEE Conference on Swarm Intelligence and Evolutionary Computation (CSIEC), 2016, pp. 1\u20135.","DOI":"10.1109\/CSIEC.2016.7482123"},{"key":"2022020121511031635_j_comp-2020-0223_ref_032","doi-asserted-by":"crossref","unstructured":"H. Sajedi and S. F. Razavi, \u201cDGSA: discrete gravitational search algorithm for solving knapsack problem,\u201d Oper. Res., vol. 17, no. 2. pp. 563\u2013591, 2017.","DOI":"10.1007\/s12351-016-0240-2"},{"key":"2022020121511031635_j_comp-2020-0223_ref_033","doi-asserted-by":"crossref","unstructured":"H. Zandevakili, E. Rashedi, and A. Mahani, \u201cGravitational search algorithm with both attractive and repulsive forces,\u201d Soft Comput., vol. 23, no. 3. pp. 783\u2013825, 2019.","DOI":"10.1007\/s00500-017-2785-2"},{"key":"2022020121511031635_j_comp-2020-0223_ref_034","doi-asserted-by":"crossref","unstructured":"C. Li, J. Zhou, J. Xiao, and H. Xiao, \u201cParameters identification of chaotic system by chaotic gravitational search algorithm,\u201d Chaos, Solitons Fractals, vol. 45, no. 4. pp. 539\u2013547, 2012.","DOI":"10.1016\/j.chaos.2012.02.005"},{"key":"2022020121511031635_j_comp-2020-0223_ref_035","doi-asserted-by":"crossref","unstructured":"S. Gao, C. Vairappan, Y. Wang, Q. Cao, and Z. Tang, \u201cGravitational search algorithm combined with chaos for unconstrained numerical optimization,\u201d Appl. Math. Comput., vol. 231, pp. 48\u201362, 2012.","DOI":"10.1016\/j.amc.2013.12.175"},{"key":"2022020121511031635_j_comp-2020-0223_ref_036","doi-asserted-by":"crossref","unstructured":"B. Alatas, E. Akin, and A. B. Ozer, \u201cChaos embedded particle swarm optimization algorithms,\u201d Chaos, Solitons Fractals, vol. 40, pp. 1715\u20131734, 2009.","DOI":"10.1016\/j.chaos.2007.09.063"},{"key":"2022020121511031635_j_comp-2020-0223_ref_037","doi-asserted-by":"crossref","unstructured":"B. Alatas, \u201cChaotic bee colony algorithms for global numerical optimization,\u201d Expert. Syst. Appl., vol. 37, no. 8. pp. 5682\u20135687, 2010.","DOI":"10.1016\/j.eswa.2010.02.042"},{"key":"2022020121511031635_j_comp-2020-0223_ref_038","doi-asserted-by":"crossref","unstructured":"B. Alatas, \u201cChaotic harmony search algorithms,\u201d Appl. Math. Comput., vol. 216, no. 9. pp. 2687\u20132699, 2010.","DOI":"10.1016\/j.amc.2010.03.114"},{"key":"2022020121511031635_j_comp-2020-0223_ref_039","doi-asserted-by":"crossref","unstructured":"G. Zhenyu, C. Bo, Y. Min, and C. Binggang, \u201cSelf-adaptive chaos differential evolution,\u201d Proceedings of Springer International Conference on Natural Computation, Berlin, Heidelberg: Springer, 2006, September, pp. 972\u2013975.","DOI":"10.1007\/11881070_128"},{"key":"2022020121511031635_j_comp-2020-0223_ref_040","doi-asserted-by":"crossref","unstructured":"J. Mingjun and T. Huanwen, \u201cApplication of chaos in simulated annealing,\u201d Chaos, Solitons Fractals, vol. 21, no. 4. pp. 933\u2013941, 2004.","DOI":"10.1016\/j.chaos.2003.12.032"},{"key":"2022020121511031635_j_comp-2020-0223_ref_041","doi-asserted-by":"crossref","unstructured":"A. H. Gandomi, X. S. Yang, S. Talatahari, and A. H. Alavi, \u201cFirefly algorithm with chaos,\u201d Commun. Nonlinear Sci. Numer. Simul., vol. 18, no. 1. pp. 89\u201398, 2013.","DOI":"10.1016\/j.cnsns.2012.06.009"},{"key":"2022020121511031635_j_comp-2020-0223_ref_042","doi-asserted-by":"crossref","unstructured":"S. Saremi, S. Mirjalili, and A. Lewis, \u201cBiogeography-based optimization with chaos,\u201d Neural Comput. Appl., vol. 25, pp. 1077\u20131097, 2014.","DOI":"10.1007\/s00521-014-1597-x"},{"key":"2022020121511031635_j_comp-2020-0223_ref_043","doi-asserted-by":"crossref","unstructured":"L. Wang and Y. Zhong, \u201cCuckoo search algorithm with chaotic maps,\u201d Math. Probl. Eng., vol. 2015, pp. 1\u201314, 2015, 10.1155\/2015\/715635.","DOI":"10.1155\/2015\/715635"},{"key":"2022020121511031635_j_comp-2020-0223_ref_044","doi-asserted-by":"crossref","unstructured":"J. Xie, Y. Zhou, and H. Chen, \u201cA novel bat algorithm based on differential operator and L\u00e9vy flights trajectory,\u201d Comput. Intell. Neurosci., vol. 2013, pp. 1\u201313, 2013, 10.1155\/2013\/453812.","DOI":"10.1155\/2013\/453812"},{"key":"2022020121511031635_j_comp-2020-0223_ref_045","doi-asserted-by":"crossref","unstructured":"X. Shan, K. Liu, and P. L. Sun, \u201cModified bat algorithm based on L\u00e9vy flight and opposition based learning,\u201d Sci. Program., vol. 2016, pp. 1\u201313, 2016, 10.1155\/2016\/8031560.","DOI":"10.1155\/2016\/8031560"},{"key":"2022020121511031635_j_comp-2020-0223_ref_046","doi-asserted-by":"crossref","unstructured":"Y. Li, X. Li, J. Liu, and X. Ruan, \u201cAn improved bat algorithm based on L\u00e9vy flights and adjustment factors,\u201d Symmetry, vol. 11, no. 7. p. 925, 2019.","DOI":"10.3390\/sym11070925"},{"key":"2022020121511031635_j_comp-2020-0223_ref_047","doi-asserted-by":"crossref","unstructured":"H. Hakl\u0131 and H. U\u011fuz, \u201cA novel particle swarm optimization algorithm with L\u00e9vy flight,\u201d Appl. Soft Comput., vol. 23, pp. 333\u2013345, 2014.","DOI":"10.1016\/j.asoc.2014.06.034"},{"key":"2022020121511031635_j_comp-2020-0223_ref_048","doi-asserted-by":"crossref","unstructured":"R. Jensi and G. W. Jiji, \u201cAn enhanced particle swarm optimization with L\u00e9vy flight for global optimization,\u201d Appl. Soft Comput., vol. 43, pp. 248\u2013261, 2016.","DOI":"10.1016\/j.asoc.2016.02.018"},{"key":"2022020121511031635_j_comp-2020-0223_ref_049","doi-asserted-by":"crossref","unstructured":"Z. Peng, K. Dong, H. Yin, and Y. Bai, \u201cModification of fish swarm algorithm based on L\u00e9vy flight and firefly behavior,\u201d Comput. Intell. Neurosci., vol. 2018, pp. 1\u201313, 2018, 10.1155\/2018\/9827372.","DOI":"10.1155\/2018\/9827372"},{"key":"2022020121511031635_j_comp-2020-0223_ref_050","doi-asserted-by":"crossref","unstructured":"S. Mirjalili, S. M. Mirjalili, and A. Hatamlou, \u201cMulti-verse optimizer: a nature-inspired algorithm for global optimization,\u201d Neural Comput. Appl., vol. 27, no. 2. pp. 495\u2013513, 2016.","DOI":"10.1007\/s00521-015-1870-7"},{"key":"2022020121511031635_j_comp-2020-0223_ref_051","doi-asserted-by":"crossref","unstructured":"C. Hu, Z. Li, T. Zhou, A. Zhu, and C. Xu, \u201cA multi-verse optimizer with L\u00e9vy flights for numerical optimization and its application in test scheduling for network-on-chip,\u201d PLoS One, vol. 11, no. 12, pp. 1\u201322, 2016, 10.1371\/journal.pone.0167341.","DOI":"10.1371\/journal.pone.0167341"},{"key":"2022020121511031635_j_comp-2020-0223_ref_052","unstructured":"D. Halliday, R. Resnick, and J. Walker, Fundamentals of Physics, NY, John Wiley & Sons, 2013."},{"key":"2022020121511031635_j_comp-2020-0223_ref_053","doi-asserted-by":"crossref","unstructured":"S. A. Rather and P. S. Bala, \u201cA holistic review on gravitational search algorithm and its hybridization with other optimization algorithms,\u201d Proceedings of IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT), 2019a, pp. 1\u20136.","DOI":"10.1109\/ICECCT.2019.8869279"},{"key":"2022020121511031635_j_comp-2020-0223_ref_054","doi-asserted-by":"crossref","unstructured":"S. A. Rather, M. Shahid, P. S. Bala, and A. Comprehensive, \u201cSurvey on solving clustering and classification problems using gravitational search algorithm,\u201d Proceedings of IEEE 9th International Conference on Advanced Computing (IACC), 2019b, pp. 13\u201318.","DOI":"10.1109\/IACC48062.2019.8971589"},{"key":"2022020121511031635_j_comp-2020-0223_ref_055","unstructured":"S. A. Rather and N. Sharma, \u201cGSA-BBO hybridization algorithm,\u201d Int. J. Adv. Sci. Eng., vol. 6, pp. 596\u2013608, 2017."},{"key":"2022020121511031635_j_comp-2020-0223_ref_056","doi-asserted-by":"crossref","unstructured":"W. Gao, D. Dimitrov, and H. Abdo, \u201cTight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs,\u201d Discret. Cont. Dyn. Syst., vol. 12, pp. 711\u2013721, 2018a.","DOI":"10.3934\/dcdss.2019045"},{"key":"2022020121511031635_j_comp-2020-0223_ref_057","doi-asserted-by":"crossref","unstructured":"W. Gao, J. L. Guirao, B. Basavanagoud, and J. Wu, \u201cPartial multi-dividing ontology learning algorithm,\u201d Inf. Sci., vol. 467, pp. 35\u201358, 2018b.","DOI":"10.1016\/j.ins.2018.07.049"},{"key":"2022020121511031635_j_comp-2020-0223_ref_058","unstructured":"X. S. Yang, Nature-Inspired Metaheuristic Algorithms, United Kingdom: Luniver Press, 2010."},{"key":"2022020121511031635_j_comp-2020-0223_ref_059","unstructured":"J. F. Yao, C. Mei, X. Q. Peng, Z. K. Hu, and J. Hu, \u201cA new optimization approach-chaos genetic algorithm,\u201d Syst. Eng., vol. 1, p. 105, 2001."},{"key":"2022020121511031635_j_comp-2020-0223_ref_060","doi-asserted-by":"crossref","unstructured":"S. Talatahari, B. F. Azar, R. Sheikholeslami, and A. H. Gandomi, \u201cImperialist competitive algorithm combined with chaos for global optimization,\u201d Commun. Nonlinear Sci. Numer. Simul., vol. 17, pp. 1312\u20131319, 2012.","DOI":"10.1016\/j.cnsns.2011.08.021"},{"key":"2022020121511031635_j_comp-2020-0223_ref_061","doi-asserted-by":"crossref","unstructured":"A. H. Gandomi and X. S. Yang, \u201cChaotic bat algorithm,\u201d J. Comput. Sci., vol. 5, pp. 224\u2013232, 2014.","DOI":"10.1016\/j.jocs.2013.10.002"},{"key":"2022020121511031635_j_comp-2020-0223_ref_062","doi-asserted-by":"crossref","unstructured":"J. Derrac, S. Garc\u00eda, D. Molina, and F. Herrera, \u201cA practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms,\u201d Swarm Evol. Comput., vol. 1, pp. 3\u201318, 2011.","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"2022020121511031635_j_comp-2020-0223_ref_063","doi-asserted-by":"crossref","unstructured":"R. V. Rao, S. J. Svani, and D. P. Vakharia, \u201cTeaching- Learning-based optimization: A novel method for constrained mechanical design optimization problems,\u201d Comput. Des., vol. 40, no. 5. pp. 303\u2013315, 2011.","DOI":"10.1016\/j.cad.2010.12.015"},{"key":"2022020121511031635_j_comp-2020-0223_ref_064","doi-asserted-by":"crossref","unstructured":"E. Rashedi, H. Nezamabadi-Pour, and S. Saryazdi, \u201cGSA: a gravitational search algorithm,\u201d Inf. Sci., vol. 179, no. 13. pp. 2232\u20132248, 2009.","DOI":"10.1016\/j.ins.2009.03.004"},{"key":"2022020121511031635_j_comp-2020-0223_ref_065","doi-asserted-by":"crossref","unstructured":"V. Jothiprakash and R. Arunkumar, \u201cOptimization of hydropower reservoir using evolutionary algorithms coupled with chaos,\u201d Water Resour. Manag., vol. 27, pp. 1963\u20131979, 2013.","DOI":"10.1007\/s11269-013-0265-8"}],"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2020-0223\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2020-0223\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T22:07:00Z","timestamp":1643753220000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2020-0223\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":65,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,12,31]]},"published-print":{"date-parts":[[2021,12,31]]}},"alternative-id":["10.1515\/comp-2020-0223"],"URL":"https:\/\/doi.org\/10.1515\/comp-2020-0223","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}