乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T16:36:24Z","timestamp":1715704584221},"reference-count":76,"publisher":"IGI Global","issue":"1","license":[{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"},{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"},{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,3,30]]},"abstract":"

The Gravitational Search Algorithm (GSA) is one of the highly regarded population-based algorithms. It has been reported that GSA has a powerful global exploration capability but suffers from the limitations of getting stuck in local optima and slow convergence speed. In order to resolve the aforementioned issues, a modified version of GSA has been proposed based on levy flight distribution and chaotic maps (LCGSA). In LCGSA, the diversification is performed by utilizing the high step size value of levy flight distribution while exploitation is carried out by chaotic maps. The LCGSA is tested on well-known 23 classical benchmark functions. Moreover, it is also applied to three constrained engineering design problems. Furthermore, the analysis of results is performed through various performance metrics like statistical measures, convergence rate, and so on. Also, a signed Wilcoxon rank-sum test has also been conducted. The simulation results indicate that LCGSA provides better results as compared to standard GSA and most of the competing algorithms.<\/p>","DOI":"10.4018\/ijamc.292496","type":"journal-article","created":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T18:43:12Z","timestamp":1637347392000},"page":"1-58","source":"Crossref","is-referenced-by-count":4,"title":["Levy Flight and Chaos Theory-Based Gravitational Search Algorithm for Global Optimization"],"prefix":"10.4018","volume":"13","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-0351-7705","authenticated-orcid":true,"given":"Sajad Ahmad","family":"Rather","sequence":"first","affiliation":[{"name":"Pondicherry University, India"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0576-4424","authenticated-orcid":true,"given":"P. Shanthi","family":"Bala","sequence":"additional","affiliation":[{"name":"Pondicherry University, India"}]}],"member":"2432","reference":[{"key":"IJAMC.292496-0","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/4854895"},{"key":"IJAMC.292496-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.02.042"},{"key":"IJAMC.292496-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2010.03.114"},{"key":"IJAMC.292496-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2007.09.063"},{"key":"IJAMC.292496-4","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012064155-0\/50012-4"},{"key":"IJAMC.292496-5","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-017-4803-x"},{"key":"IJAMC.292496-6","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2014.04.006"},{"key":"IJAMC.292496-7","doi-asserted-by":"publisher","DOI":"10.3390\/app8030329"},{"key":"IJAMC.292496-8","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-3615(99)00046-9"},{"key":"IJAMC.292496-9","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.10.047"},{"key":"IJAMC.292496-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"IJAMC.292496-11","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"IJAMC.292496-12","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"IJAMC.292496-13","doi-asserted-by":"publisher","DOI":"10.3233\/FI-1998-35123403"},{"key":"IJAMC.292496-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2013.10.002"},{"key":"IJAMC.292496-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2012.06.009"},{"key":"IJAMC.292496-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2012.07.017"},{"key":"IJAMC.292496-17","doi-asserted-by":"crossref","unstructured":"Gao, W., Dimitrov, D., & Abdo, H. (2018). Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs.\u00a0Discrete & Continuous Dynamical Systems-S, 12, 711-721.","DOI":"10.3934\/dcdss.2019045"},{"key":"IJAMC.292496-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.07.049"},{"key":"IJAMC.292496-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.05.017"},{"key":"IJAMC.292496-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.scient.2012.02.030"},{"key":"IJAMC.292496-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.06.034"},{"key":"IJAMC.292496-22","author":"D.Halliday","year":"2000","journal-title":"Fundamentals of Physics"},{"key":"IJAMC.292496-23","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.103249"},{"key":"IJAMC.292496-24","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"IJAMC.292496-25","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0167341"},{"key":"IJAMC.292496-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.02.018"},{"key":"IJAMC.292496-27","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/1957812"},{"key":"IJAMC.292496-28","doi-asserted-by":"publisher","DOI":"10.1007\/s11269-013-0265-8"},{"key":"IJAMC.292496-29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.02.037"},{"key":"IJAMC.292496-30","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"IJAMC.292496-31","doi-asserted-by":"publisher","DOI":"10.1109\/CSIEC.2016.7482123"},{"key":"IJAMC.292496-32","doi-asserted-by":"publisher","DOI":"10.1007\/s10825-020-01476-8"},{"key":"IJAMC.292496-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2012.02.005"},{"key":"IJAMC.292496-34","doi-asserted-by":"publisher","DOI":"10.3390\/sym11070925"},{"key":"IJAMC.292496-35","article-title":"L\u00e9vy-flight moth-flame algorithm for function optimization and engineering design problems.","author":"Z.Li","year":"2016","journal-title":"Mathematical Problems in Engineering"},{"key":"IJAMC.292496-36","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2003.12.032"},{"key":"IJAMC.292496-37","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2015.01.010"},{"key":"IJAMC.292496-38","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.022"},{"key":"IJAMC.292496-39","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.01.008"},{"key":"IJAMC.292496-40","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.07.002"},{"key":"IJAMC.292496-41","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.04.069"},{"key":"IJAMC.292496-42","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"IJAMC.292496-43","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"IJAMC.292496-44","doi-asserted-by":"publisher","DOI":"10.3390\/en11040736"},{"key":"IJAMC.292496-45","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/9827372"},{"key":"IJAMC.292496-46","doi-asserted-by":"publisher","DOI":"10.1007\/s10772-014-9232-x"},{"key":"IJAMC.292496-47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.03.004"},{"key":"IJAMC.292496-48","doi-asserted-by":"publisher","DOI":"10.1109\/ICECCT.2019.8869279"},{"key":"IJAMC.292496-49","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-7998-0106-1.ch005"},{"key":"IJAMC.292496-50","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3576489"},{"key":"IJAMC.292496-51","doi-asserted-by":"crossref","unstructured":"Rather, S. A., & Bala, P. S. (2019d). Hybridization of Constriction Coefficient-Based Particle Swarm Optimization and Chaotic Gravitational Search Algorithm for Solving Engineering Design Problems. In\u00a0International Conference on Advanced Communication and Networking\u00a0(pp. 95-115). Springer. doi:10.1007\/978-981-15-3852-0_7","DOI":"10.1007\/978-981-15-3852-0_7"},{"key":"IJAMC.292496-52","doi-asserted-by":"publisher","DOI":"10.1108\/IJICC-09-2019-0105"},{"key":"IJAMC.292496-53","doi-asserted-by":"publisher","DOI":"10.1108\/WJE-09-2019-0254"},{"key":"IJAMC.292496-54","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2021.116617"},{"key":"IJAMC.292496-55","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12717"},{"key":"IJAMC.292496-56","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.03.011"},{"key":"IJAMC.292496-57","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-016-0240-2"},{"key":"IJAMC.292496-58","doi-asserted-by":"publisher","DOI":"10.1115\/1.2912596"},{"key":"IJAMC.292496-59","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-014-1597-x"},{"key":"IJAMC.292496-60","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/2482543"},{"key":"IJAMC.292496-61","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/8031560"},{"key":"IJAMC.292496-62","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2015.7257028"},{"key":"IJAMC.292496-63","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.919004"},{"key":"IJAMC.292496-64","unstructured":"Storn, R. (1995). Differential Evolution. Technical report TR-95-012, International Computer Science Institute."},{"key":"IJAMC.292496-65","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.103330"},{"key":"IJAMC.292496-66","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2011.08.021"},{"key":"IJAMC.292496-67","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/715635"},{"key":"IJAMC.292496-68","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"IJAMC.292496-69","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/453812"},{"key":"IJAMC.292496-70","author":"X. S.Yang","year":"2010","journal-title":"Nature\u2010Inspired Metaheuristic Algorithms"},{"key":"IJAMC.292496-71","unstructured":"Yao, J. F., Mei, C., Peng, X. Q., Hu, Z. K., & Hu, J. (2001). A new optimization approach-chaos genetic algorithm.\u00a0Systems Engineering,\u00a01, 0-15."},{"key":"IJAMC.292496-72","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2013.08.001"},{"key":"IJAMC.292496-73","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.01.018"},{"key":"IJAMC.292496-74","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2785-2"},{"key":"IJAMC.292496-75","doi-asserted-by":"publisher","DOI":"10.1007\/11881070_128"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=292496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T22:26:17Z","timestamp":1673907977000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJAMC.292496"}},"subtitle":["LCGSA for Global Optimization"],"short-title":[],"issued":{"date-parts":[[2022,3,30]]},"references-count":76,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijamc.292496","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,30]]}}}