{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T08:52:42Z","timestamp":1778662362262,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,4,18]],"date-time":"2017-04-18T00:00:00Z","timestamp":1492473600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s00521-017-2977-9","type":"journal-article","created":{"date-parts":[[2017,4,18]],"date-time":"2017-04-18T08:44:58Z","timestamp":1492505098000},"page":"27-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Escape velocity: a new operator for gravitational search algorithm"],"prefix":"10.1007","volume":"31","author":[{"given":"U.","family":"G\u00fcven\u00e7","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Kat\u0131rc\u0131o\u011flu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,18]]},"reference":[{"issue":"13","key":"2977_CR1","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"EJ Rashedi","year":"2009","unstructured":"Rashedi EJ, Nezamabadi-pour H, Sarazdi S (2009) A gravitational search algorithm. Information Science 179(13):2232\u20132248","journal-title":"Information Science"},{"issue":"3","key":"2977_CR2","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.scient.2011.04.003","volume":"18","author":"S Sarafrazi","year":"2011","unstructured":"Sarafrazi S, Nezamabadi-pour H, Sarazdi S (2011) Disruption: a new operator in gravitational search algorithm. Scientia Iranica 18(3):539\u2013548","journal-title":"Scientia Iranica"},{"issue":"10","key":"2977_CR3","doi-asserted-by":"publisher","first-page":"2712","DOI":"10.1007\/s11431-012-4890-x","volume":"55","author":"L Pei","year":"2012","unstructured":"Pei L, HaiBin D (2012) Path planning of unmanned aerial vehicle based on improved gravitational search algorithm. Science China Technological Science 55(10):2712\u20132719","journal-title":"Science China Technological Science"},{"issue":"1","key":"2977_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.enconman.2010.07.012","volume":"52","author":"L Chaoshunand","year":"2011","unstructured":"Chaoshunand L, Jianzhong Z (2011) Parameters identification of hydraulic turbine governing system using improved gravitational search algorithm. Energy Convers Manag 52(1):374\u2013381","journal-title":"Energy Convers Manag"},{"issue":"4","key":"2977_CR5","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.chaos.2012.02.005","volume":"45","author":"L Chaoshun","year":"2012","unstructured":"Chaoshun L (2012) Parameters identification of chaotic system by chaotic gravitational search algorithm. Chaos, Solitions & Fractals 45(4):539\u2013547","journal-title":"Chaos, Solitions & Fractals"},{"issue":"8","key":"2977_CR6","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1016\/j.engappai.2012.01.011","volume":"25","author":"M Khajehzadeh","year":"2012","unstructured":"Khajehzadeh M (2012) A modified gravitational search algorithm for slope stability analysis. Eng Appl Artif Intell 25(8):1589\u20131597","journal-title":"Eng Appl Artif Intell"},{"key":"2977_CR7","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ins.2012.04.039","volume":"208","author":"X Han","year":"2012","unstructured":"Han X, Chang X (2012) A chaotic digital secure communication based on a modified gravitational search algorithm filter. Inf Sci 208:14\u201327","journal-title":"Inf Sci"},{"key":"2977_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.asoc.2014.07.016","volume":"24","author":"S Jiang","year":"2014","unstructured":"Jiang S, Wang Y, Ji Z (2014) Convergence analysis and performance of an improved gravitational search algorithm. Appl Soft Comput 24:363\u2013384","journal-title":"Appl Soft Comput"},{"key":"2977_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jnca.2013.04.007","volume":"38","author":"M Doraghinejad","year":"2014","unstructured":"Doraghinejad M, Nezamabadi-pour H, Mahani A (2014) Channel assignment in multi-radio wireless mesh networks using an improved gravitational search algorithm. J Netw Comput Appl 38:163\u2013171","journal-title":"J Netw Comput Appl"},{"key":"2977_CR10","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ins.2013.09.034","volume":"258","author":"DM Bagher","year":"2014","unstructured":"Bagher DM, Nezamabadi-pour H, Mashinchi M (2014) A discrete gravitational search algorithm for solving combinatorial optimization problems. Inf Sci 258:94\u2013107","journal-title":"Inf Sci"},{"key":"2977_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ins.2013.09.006","volume":"267","author":"M Soleimanpour-moghadam","year":"2014","unstructured":"Soleimanpour-moghadam M, Nezamabadi-pour H, Farsangi M, Maliha M (2014) A quantum inspired gravitational search algorithm for numerical function optimization. Inf Sci 267:83\u2013100","journal-title":"Inf Sci"},{"issue":"1","key":"2977_CR12","first-page":"143","volume":"3","author":"U Guvenc","year":"2015","unstructured":"Guvenc U, Kat\u0131rc\u0131oglu F (2015) Best agent-specific behavior: improved gravitational search algorithm. Ecjse Journal of Science and Engineering 3(1):143\u2013153","journal-title":"Ecjse Journal of Science and Engineering"},{"issue":"4","key":"2977_CR13","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1016\/j.engappai.2012.10.002","volume":"26","author":"E Rashedi","year":"2013","unstructured":"Rashedi E, Nezamabadi-Pour H (2013) A stochastic gravitational approach to feature based color image segmentation. Eng Appl Artif Intell 26(4):1322\u20131332","journal-title":"Eng Appl Artif Intell"},{"key":"2977_CR14","unstructured":"Kat\u0131rc\u0131oglu F (2016) Improving of new operators for gravitational search algorithm Ph.D. dissertation, Dept. Elect-Electronic and Computer Eng., Duzce Univ., Duzce, Turkey"},{"key":"2977_CR15","doi-asserted-by":"crossref","unstructured":"Mirjalili S and Hashim SZM (2010) A new hybrid PSOGSA algorithm for function optimization, International conference on computer and information application","DOI":"10.1109\/ICCIA.2010.6141614"},{"key":"2977_CR16","unstructured":"Crothers SJ (2015) Black hole escape velocity\u2014a case study in the decay of physics and astronomy Available: http:\/\/www.rxiv.org\/pdf\/1508.0066v1.pdf"},{"key":"2977_CR17","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3:82\u2013100","journal-title":"IEEE Trans Evol Comput"},{"key":"2977_CR18","unstructured":"Suganthan P N, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S(2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization KanGAL report"},{"issue":"1","key":"2977_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones DR, Perttunen CD, Stuckman BE (1993) Lipschitzian optimization without the Lipschitz constant. J Optim Theory Appl 79(1):157\u2013181","journal-title":"J Optim Theory Appl"},{"key":"2977_CR20","doi-asserted-by":"crossref","unstructured":"Haupt RL and Haupt SE (2004) Practical genetic algorithms John Wiley & Sons 2004","DOI":"10.1002\/0471671746"},{"issue":"17","key":"2977_CR21","first-page":"9106","volume":"219","author":"HC Tsai","year":"2013","unstructured":"Tsai HC, Tyan YY, Wu YW, Lin YH (2013) Gravitational particle swarm. Appl Math Comput 219(17):9106\u20139117","journal-title":"Appl Math Comput"},{"issue":"2","key":"2977_CR22","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00366-013-0343-9","volume":"31","author":"X Han","year":"2015","unstructured":"Han X, Quan L, Xiong X, Wu B (2015) Diversity enhanced and local search accelerated gravitational search algorithm for data fitting with B-splines. Eng Comput 31(2):215\u2013236","journal-title":"Eng Comput"},{"key":"2977_CR23","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garcia","year":"2008","unstructured":"Garcia S, Molina D, Lozano M (2008) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 special on real parameter optimization. J Heuristics 15:617\u2013644","journal-title":"J Heuristics"},{"key":"2977_CR24","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"6","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biometrics 6:80\u201383","journal-title":"Biometrics"},{"key":"2977_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.14311\/NNW.2015.25.003","volume":"25","author":"A Zhang","year":"2015","unstructured":"Zhang A, Sun G, Wang Z, Yao Y (2015) A hybrid genetic algorithm and gravitational search algorithm for global optimization. Neural Network World 25:53\u201373","journal-title":"Neural Network World"},{"key":"2977_CR26","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/SIS.2005.1501604","volume":"2005","author":"JJ Liang","year":"2005","unstructured":"Liang JJ, Suganthan PN, Deb K (2005) Novel composition test functions for numerical global optimization. In Proceedings 2005 I.E. Swarm Intelligence Symposium 2005:68\u201375","journal-title":"In Proceedings 2005 I.E. Swarm Intelligence Symposium"},{"issue":"7\u20138","key":"2977_CR27","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1007\/s00521-014-1640-y","volume":"25","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Lewis A (2014) Adaptive gbest-guided gravitational search algorithm. Neural Comput & Applic 25(7\u20138):1569\u20131584","journal-title":"Neural Comput & Applic"},{"issue":"4","key":"2977_CR28","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s00521-015-1920-1","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput & Applic 27(4):1053\u20131073","journal-title":"Neural Comput & Applic"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-017-2977-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-2977-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-2977-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T01:39:20Z","timestamp":1569029960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-017-2977-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,18]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["2977"],"URL":"https:\/\/doi.org\/10.1007\/s00521-017-2977-9","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,18]]},"assertion":[{"value":"12 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}