Loading…
Comprehensive learning gravitational search algorithm for global optimization of multimodal functions
In this paper, a new comprehensive learning gravitational search algorithm (CLGSA) is proposed to enhance the performance of basic GSA. The proposed algorithm is a new kind of intelligent optimization algorithm which has better ability to choose good elements. An intensive comprehensive learning met...
Saved in:
Published in: | Neural computing & applications 2020-06, Vol.32 (11), p.7347-7382 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c362t-8ae53efce0b4b9f8993adc0557d20ecaa120b3d933b75cd7112100ae7b6e9f243 |
---|---|
cites | cdi_FETCH-LOGICAL-c362t-8ae53efce0b4b9f8993adc0557d20ecaa120b3d933b75cd7112100ae7b6e9f243 |
container_end_page | 7382 |
container_issue | 11 |
container_start_page | 7347 |
container_title | Neural computing & applications |
container_volume | 32 |
creator | Bala, Indu Yadav, Anupam |
description | In this paper, a new comprehensive learning gravitational search algorithm (CLGSA) is proposed to enhance the performance of basic GSA. The proposed algorithm is a new kind of intelligent optimization algorithm which has better ability to choose good elements. An intensive comprehensive learning methodology is proposed to enrich the optimization ability of the GSA. The efficiency of the proposed algorithm was evaluated by 28 benchmark functions which have been proposed in IEEE-CEC 2013 sessions. The results are compared with eight state-of-the-art algorithms IPOP, BIPOP, NIPOP, NBIPOP, DE/rand, SPSRDEMMS, SPSO-2011 and GSA. A variety of ways are considered to examine the ability of the proposed technique in terms of convergence ability, success rate and statistical behavior of algorithm over dimensions 10, 30 and 50. Apart from experimental studies, theoretical stability of the proposed CLGSA is also proved. It was concluded that the proposed algorithm performed efficiently with good results. |
doi_str_mv | 10.1007/s00521-019-04250-5 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2407710401</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2407710401</sourcerecordid><originalsourceid>FETCH-LOGICAL-c362t-8ae53efce0b4b9f8993adc0557d20ecaa120b3d933b75cd7112100ae7b6e9f243</originalsourceid><addsrcrecordid>eNp9kEtLxDAUhYMoOI7-AVcB19WbVx9LGXyB4EbXIU2TToa2qUk7oL_ezFRw5-rCOd85cA9C1wRuCUBxFwEEJRmQKgNOBWTiBK0IZyxjIMpTtIKKJzvn7BxdxLgDAJ6XYoXMxvdjMFszRLc3uDMqDG5ocRvU3k1qcn5QHY5J1lusutYHN217bH3Abefr5Plxcr37PqLYW9zPXRJ8kyw7D_ogx0t0ZlUXzdXvXaOPx4f3zXP2-vb0srl_zTTL6ZSVyghmrDZQ87qyZVUx1WgQomgoGK0UoVCzpmKsLoRuCkJo-l6Zos5NZSlna3Sz9I7Bf84mTnLn55A-iJJyKAoCHEii6ELp4GMMxsoxuF6FL0lAHuaUy5wyzSmPc0qRQmwJxQQPrQl_1f-kfgCqDHqn</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2407710401</pqid></control><display><type>article</type><title>Comprehensive learning gravitational search algorithm for global optimization of multimodal functions</title><source>Springer Nature</source><creator>Bala, Indu ; Yadav, Anupam</creator><creatorcontrib>Bala, Indu ; Yadav, Anupam</creatorcontrib><description>In this paper, a new comprehensive learning gravitational search algorithm (CLGSA) is proposed to enhance the performance of basic GSA. The proposed algorithm is a new kind of intelligent optimization algorithm which has better ability to choose good elements. An intensive comprehensive learning methodology is proposed to enrich the optimization ability of the GSA. The efficiency of the proposed algorithm was evaluated by 28 benchmark functions which have been proposed in IEEE-CEC 2013 sessions. The results are compared with eight state-of-the-art algorithms IPOP, BIPOP, NIPOP, NBIPOP, DE/rand, SPSRDEMMS, SPSO-2011 and GSA. A variety of ways are considered to examine the ability of the proposed technique in terms of convergence ability, success rate and statistical behavior of algorithm over dimensions 10, 30 and 50. Apart from experimental studies, theoretical stability of the proposed CLGSA is also proved. It was concluded that the proposed algorithm performed efficiently with good results.</description><identifier>ISSN: 0941-0643</identifier><identifier>EISSN: 1433-3058</identifier><identifier>DOI: 10.1007/s00521-019-04250-5</identifier><language>eng</language><publisher>London: Springer London</publisher><subject>Algorithms ; Artificial Intelligence ; Computational Biology/Bioinformatics ; Computational Science and Engineering ; Computer Science ; Data Mining and Knowledge Discovery ; Global optimization ; Gravitation ; Image Processing and Computer Vision ; Machine learning ; Optimization ; Original Article ; Probability and Statistics in Computer Science ; Search algorithms</subject><ispartof>Neural computing & applications, 2020-06, Vol.32 (11), p.7347-7382</ispartof><rights>Springer-Verlag London Ltd., part of Springer Nature 2019</rights><rights>Springer-Verlag London Ltd., part of Springer Nature 2019.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c362t-8ae53efce0b4b9f8993adc0557d20ecaa120b3d933b75cd7112100ae7b6e9f243</citedby><cites>FETCH-LOGICAL-c362t-8ae53efce0b4b9f8993adc0557d20ecaa120b3d933b75cd7112100ae7b6e9f243</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Bala, Indu</creatorcontrib><creatorcontrib>Yadav, Anupam</creatorcontrib><title>Comprehensive learning gravitational search algorithm for global optimization of multimodal functions</title><title>Neural computing & applications</title><addtitle>Neural Comput & Applic</addtitle><description>In this paper, a new comprehensive learning gravitational search algorithm (CLGSA) is proposed to enhance the performance of basic GSA. The proposed algorithm is a new kind of intelligent optimization algorithm which has better ability to choose good elements. An intensive comprehensive learning methodology is proposed to enrich the optimization ability of the GSA. The efficiency of the proposed algorithm was evaluated by 28 benchmark functions which have been proposed in IEEE-CEC 2013 sessions. The results are compared with eight state-of-the-art algorithms IPOP, BIPOP, NIPOP, NBIPOP, DE/rand, SPSRDEMMS, SPSO-2011 and GSA. A variety of ways are considered to examine the ability of the proposed technique in terms of convergence ability, success rate and statistical behavior of algorithm over dimensions 10, 30 and 50. Apart from experimental studies, theoretical stability of the proposed CLGSA is also proved. It was concluded that the proposed algorithm performed efficiently with good results.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Computational Biology/Bioinformatics</subject><subject>Computational Science and Engineering</subject><subject>Computer Science</subject><subject>Data Mining and Knowledge Discovery</subject><subject>Global optimization</subject><subject>Gravitation</subject><subject>Image Processing and Computer Vision</subject><subject>Machine learning</subject><subject>Optimization</subject><subject>Original Article</subject><subject>Probability and Statistics in Computer Science</subject><subject>Search algorithms</subject><issn>0941-0643</issn><issn>1433-3058</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLxDAUhYMoOI7-AVcB19WbVx9LGXyB4EbXIU2TToa2qUk7oL_ezFRw5-rCOd85cA9C1wRuCUBxFwEEJRmQKgNOBWTiBK0IZyxjIMpTtIKKJzvn7BxdxLgDAJ6XYoXMxvdjMFszRLc3uDMqDG5ocRvU3k1qcn5QHY5J1lusutYHN217bH3Abefr5Plxcr37PqLYW9zPXRJ8kyw7D_ogx0t0ZlUXzdXvXaOPx4f3zXP2-vb0srl_zTTL6ZSVyghmrDZQ87qyZVUx1WgQomgoGK0UoVCzpmKsLoRuCkJo-l6Zos5NZSlna3Sz9I7Bf84mTnLn55A-iJJyKAoCHEii6ELp4GMMxsoxuF6FL0lAHuaUy5wyzSmPc0qRQmwJxQQPrQl_1f-kfgCqDHqn</recordid><startdate>20200601</startdate><enddate>20200601</enddate><creator>Bala, Indu</creator><creator>Yadav, Anupam</creator><general>Springer London</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20200601</creationdate><title>Comprehensive learning gravitational search algorithm for global optimization of multimodal functions</title><author>Bala, Indu ; Yadav, Anupam</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c362t-8ae53efce0b4b9f8993adc0557d20ecaa120b3d933b75cd7112100ae7b6e9f243</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Computational Biology/Bioinformatics</topic><topic>Computational Science and Engineering</topic><topic>Computer Science</topic><topic>Data Mining and Knowledge Discovery</topic><topic>Global optimization</topic><topic>Gravitation</topic><topic>Image Processing and Computer Vision</topic><topic>Machine learning</topic><topic>Optimization</topic><topic>Original Article</topic><topic>Probability and Statistics in Computer Science</topic><topic>Search algorithms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bala, Indu</creatorcontrib><creatorcontrib>Yadav, Anupam</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest advanced technologies & aerospace journals</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>Neural computing & applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bala, Indu</au><au>Yadav, Anupam</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Comprehensive learning gravitational search algorithm for global optimization of multimodal functions</atitle><jtitle>Neural computing & applications</jtitle><stitle>Neural Comput & Applic</stitle><date>2020-06-01</date><risdate>2020</risdate><volume>32</volume><issue>11</issue><spage>7347</spage><epage>7382</epage><pages>7347-7382</pages><issn>0941-0643</issn><eissn>1433-3058</eissn><abstract>In this paper, a new comprehensive learning gravitational search algorithm (CLGSA) is proposed to enhance the performance of basic GSA. The proposed algorithm is a new kind of intelligent optimization algorithm which has better ability to choose good elements. An intensive comprehensive learning methodology is proposed to enrich the optimization ability of the GSA. The efficiency of the proposed algorithm was evaluated by 28 benchmark functions which have been proposed in IEEE-CEC 2013 sessions. The results are compared with eight state-of-the-art algorithms IPOP, BIPOP, NIPOP, NBIPOP, DE/rand, SPSRDEMMS, SPSO-2011 and GSA. A variety of ways are considered to examine the ability of the proposed technique in terms of convergence ability, success rate and statistical behavior of algorithm over dimensions 10, 30 and 50. Apart from experimental studies, theoretical stability of the proposed CLGSA is also proved. It was concluded that the proposed algorithm performed efficiently with good results.</abstract><cop>London</cop><pub>Springer London</pub><doi>10.1007/s00521-019-04250-5</doi><tpages>36</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0941-0643 |
ispartof | Neural computing & applications, 2020-06, Vol.32 (11), p.7347-7382 |
issn | 0941-0643 1433-3058 |
language | eng |
recordid | cdi_proquest_journals_2407710401 |
source | Springer Nature |
subjects | Algorithms Artificial Intelligence Computational Biology/Bioinformatics Computational Science and Engineering Computer Science Data Mining and Knowledge Discovery Global optimization Gravitation Image Processing and Computer Vision Machine learning Optimization Original Article Probability and Statistics in Computer Science Search algorithms |
title | Comprehensive learning gravitational search algorithm for global optimization of multimodal functions |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T04%3A54%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Comprehensive%20learning%20gravitational%20search%20algorithm%20for%20global%20optimization%20of%20multimodal%20functions&rft.jtitle=Neural%20computing%20&%20applications&rft.au=Bala,%20Indu&rft.date=2020-06-01&rft.volume=32&rft.issue=11&rft.spage=7347&rft.epage=7382&rft.pages=7347-7382&rft.issn=0941-0643&rft.eissn=1433-3058&rft_id=info:doi/10.1007/s00521-019-04250-5&rft_dat=%3Cproquest_cross%3E2407710401%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c362t-8ae53efce0b4b9f8993adc0557d20ecaa120b3d933b75cd7112100ae7b6e9f243%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2407710401&rft_id=info:pmid/&rfr_iscdi=true |