{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T05:05:16Z","timestamp":1774674316028,"version":"3.50.1"},"reference-count":21,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T00:00:00Z","timestamp":1568246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2019,10,25]]},"abstract":"<jats:p>\n                    Gravitational search algorithm (GSA) is inspired by swarm behaviors in nature and physical law based on Newtonian gravity and the laws of motion. There are two key parameters including the number of applied agents (\n                    <jats:italic>Kbest<\/jats:italic>\n                    ) and gravitational coefficient (\n                    <jats:italic>G<\/jats:italic>\n                    ) to control the search progress in the algorithm. In the conventional GSA, the acceleration of the agents is mainly determined by\n                    <jats:italic>Kbest<\/jats:italic>\n                    and\n                    <jats:italic>G.<\/jats:italic>\n                    <jats:italic>Kbest<\/jats:italic>\n                    and\n                    <jats:italic>G<\/jats:italic>\n                    are calculated by a monotonically decreasing function, which is not a good schedule for solving complex problems. In order to solve the problem and accelerate the convergence of algorithm, an adaptive GSA is proposed, in which\n                    <jats:italic>Kbest<\/jats:italic>\n                    and\n                    <jats:italic>G<\/jats:italic>\n                    calculation method for strengthening exploitation capability are implemented to achieve better optimization results. Extensive experimental results based on benchmark functions are provided to show the effectiveness of the proposed method. The obtained results have been compared with the results of the original GSA, CGSA, and CLPSO. The comparison results have revealed that the proposed method has good performances.\n                  <\/jats:p>","DOI":"10.3233\/jifs-182779","type":"journal-article","created":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T11:42:48Z","timestamp":1568374968000},"page":"5039-5047","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["An improved gravitational search algorithm for global optimization"],"prefix":"10.1177","volume":"37","author":[{"given":"Yu","family":"Xiaobing","sequence":"first","affiliation":[{"name":"School of Management Science and Engineering, Nanjing University of Information Science and Technology, Nanjing, China"}]},{"given":"Yu","family":"Xianrui","sequence":"additional","affiliation":[{"name":"School of Management Science and Engineering, Nanjing University of Information Science and Technology, Nanjing, China"}]},{"given":"Chen","family":"Hong","sequence":"additional","affiliation":[{"name":"School of Management Science and Engineering, Nanjing University of Information Science and Technology, Nanjing, China"}]}],"member":"179","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"issue":"7","key":"e_1_3_2_2_2","first-page":"2104","author":"Goldberg D.E.","year":"1989","unstructured":"GoldbergD.E., et al., Genetic Algorithm is Search Optimization and Machine Learning xiii(7) (1989), 2104\u20132116.","journal-title":"Genetic Algorithm is Search Optimization and Machine Learning"},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","unstructured":"FormatoR.A. Central Force Optimization: A New Nature Inspired Computational Framework for Multidimensional Search and Optimization (2008) 221\u2013238.","DOI":"10.1007\/978-3-540-78987-1_21"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","unstructured":"KennedyJ. Particle Swarm Optimization Proc of 1995 IEEE Int Conf Neural Networks (Perth Australia) 4(8) (2011) 1942\u20131948.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1152\/physrev.2000.80.3.1055"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.03.004"},{"issue":"2","key":"e_1_3_2_7_2","first-page":"167","article-title":"Parameter Control in Evolutionary Algorithms","volume":"19","author":"Eiben A.E.","year":"2007","unstructured":"EibenA.E., et al., Parameter Control in Evolutionary Algorithms, Evolutionary Computation IEEE Transactions on 19(2) (2007), 167\u2013187.","journal-title":"Evolutionary Computation IEEE Transactions on"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-011-0052-x"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-009-9175-3"},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","unstructured":"ShamsudinH.C. et al. A Fast Discrete Gravitational Search Algorithm. in International Conference on Computational Intelligence. 2012.","DOI":"10.1109\/CIMSim.2012.28"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2011.06.048"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scient.2011.04.003"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.04.039"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"NobahariH. NikusokhanM. and SiarryP. A MultiObjective Gravitational Search Algorithm Based on Non-Dominated Sorting. 2012: IGI Global. 32\u201349.","DOI":"10.4018\/jsir.2012070103"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.12.008"},{"key":"e_1_3_2_16_2","unstructured":"MoodS.E. RashediE. and JavidiM.M. New Functions for Mass Calculation in Gravitational Search Algorithm. 2016."},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","unstructured":"KhajooeiF. and RashediE. A new version of Gravitational Search Algorithm with negative mass. in Conference on Swarm Intelligence and Evolutionary Computation 2016.","DOI":"10.1109\/CSIEC.2016.7482123"},{"key":"e_1_3_2_18_2","first-page":"3","volume":"18","author":"Fister I.","year":"2015","unstructured":"FisterI., et al., Adaptation and Hybridization in Nature-Inspired Algorithms 18 (2015), 3\u201350.","journal-title":"Adaptation and Hybridization in Nature-Inspired Algorithms"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.02.018"},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","unstructured":"Saeidi-KhabisiF.S. and RashediE. Fuzzy gravitational search algorithm. in International Econference on Computer and Knowledge Engineering 2012.","DOI":"10.1109\/ICCKE.2012.6395370"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.01.008"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.857610"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-182779","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-182779","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-182779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:56:29Z","timestamp":1770231389000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-182779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,12]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10,25]]}},"alternative-id":["10.3233\/JIFS-182779"],"URL":"https:\/\/doi.org\/10.3233\/jifs-182779","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,12]]}}}