Loading…

A Novel Slime Mould Multiverse Algorithm for Global Optimization and Mechanical Engineering Design Problems

The slime mould optimization algorithm (SMA) is one of the well-established optimization algorithms with a superior performance in a variety of real-life optimization problems. The SMA has certain limitations that reduce the diversity and accuracy of solutions, raising the risk of premature converge...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computational intelligence systems 2024-12, Vol.17 (1), p.1-56
Main Authors: Thakur, Gauri, Pal, Ashok
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 56
container_issue 1
container_start_page 1
container_title International journal of computational intelligence systems
container_volume 17
creator Thakur, Gauri
Pal, Ashok
description The slime mould optimization algorithm (SMA) is one of the well-established optimization algorithms with a superior performance in a variety of real-life optimization problems. The SMA has certain limitations that reduce the diversity and accuracy of solutions, raising the risk of premature convergence with an inadequate balance between its exploitation and exploration phases. In this study, a novel hybrid slime mould multi-verse algorithm (SMMVA) is proposed to improve the performance of SMA algorithm. The SMA and multi-verse optimization (MVO) algorithm hybrid is introduced while updating variation parameter through novel nonlinear convergence factor. The proposed algorithm balances the ability of the SMA algorithm to explore and exploit, boosts the global exploration capability and improves the accuracy, stability, and convergence speed. The performance of SMMVA algorithm is compared with 16 well-established and recently-published metaheuristic algorithms on 23 standard benchmark functions, CEC2017, CEC2022 test functions, five engineering design problems, and five UCI repository datasets. The statistical tests such as Friedman’s test, box plot comparison and Wilcoxon rank sum test are employed to verify the SMMVA’s stability and statistical superiority. The algorithm was tested on total 64 benchmark functions, achieving an overall success rate of 68.75% across 30 runs compared to the other counterparts. The results for the feature selection problem show that the proposed algorithm with k-nearest neighbour (KNN) classifier obtained more informative features with higher accuracy values. Thus, the proposed SMMVA algorithm is proven to perform excellent performance in solving optimization problems with better solution accuracy and promising prospect.
doi_str_mv 10.1007/s44196-024-00704-4
format article
fullrecord <record><control><sourceid>doaj_sprin</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_f1c6974f2b224e31a4ed5876c6987387</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_f1c6974f2b224e31a4ed5876c6987387</doaj_id><sourcerecordid>oai_doaj_org_article_f1c6974f2b224e31a4ed5876c6987387</sourcerecordid><originalsourceid>FETCH-LOGICAL-d1104-9d912b96a2a056194719168b3716ba97edd251e42a8bb6ffdc1e58aaf37fbade3</originalsourceid><addsrcrecordid>eNotkN1q5DAMhU2h0DLtC-yVXyC7luPYyeUw2-0Wpj_Q7rWRYyXjWScenEyhffqmnYJA6Agdjj7GfoD4CUKYX5NS0OhCSFUso1CFOmOXUJuq0HVdXrDradoLISQoIZS6ZP_X_CG9UuTPMQzE79Mxen5_jHN4pTwRX8c-5TDvBt6lzG9jchj542EOQ3jHOaSR47gcULvDMbTL7mbsw0iUw9jz3zSFfuRPOblIw3TFzjuME11_9xX79-fmZfO32D7e3m3W28IDLIkb34B0jUaJotLQKAMN6NqVBrTDxpD3sgJSEmvndNf5FqiqEbvSdA49lSt2d_L1Cff2kMOA-c0mDPZLSLm3mOfQRrIdtLoxqpNOSkUloCJf1UYvam3KpVasPHlNh8-XKNt9OuZxiW9B2E_k9oTcLsjtF3Kryg--OHay</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Novel Slime Mould Multiverse Algorithm for Global Optimization and Mechanical Engineering Design Problems</title><source>Springer Nature - SpringerLink Journals - Fully Open Access </source><creator>Thakur, Gauri ; Pal, Ashok</creator><creatorcontrib>Thakur, Gauri ; Pal, Ashok</creatorcontrib><description>The slime mould optimization algorithm (SMA) is one of the well-established optimization algorithms with a superior performance in a variety of real-life optimization problems. The SMA has certain limitations that reduce the diversity and accuracy of solutions, raising the risk of premature convergence with an inadequate balance between its exploitation and exploration phases. In this study, a novel hybrid slime mould multi-verse algorithm (SMMVA) is proposed to improve the performance of SMA algorithm. The SMA and multi-verse optimization (MVO) algorithm hybrid is introduced while updating variation parameter through novel nonlinear convergence factor. The proposed algorithm balances the ability of the SMA algorithm to explore and exploit, boosts the global exploration capability and improves the accuracy, stability, and convergence speed. The performance of SMMVA algorithm is compared with 16 well-established and recently-published metaheuristic algorithms on 23 standard benchmark functions, CEC2017, CEC2022 test functions, five engineering design problems, and five UCI repository datasets. The statistical tests such as Friedman’s test, box plot comparison and Wilcoxon rank sum test are employed to verify the SMMVA’s stability and statistical superiority. The algorithm was tested on total 64 benchmark functions, achieving an overall success rate of 68.75% across 30 runs compared to the other counterparts. The results for the feature selection problem show that the proposed algorithm with k-nearest neighbour (KNN) classifier obtained more informative features with higher accuracy values. Thus, the proposed SMMVA algorithm is proven to perform excellent performance in solving optimization problems with better solution accuracy and promising prospect.</description><identifier>EISSN: 1875-6883</identifier><identifier>DOI: 10.1007/s44196-024-00704-4</identifier><language>eng</language><publisher>Dordrecht: Springer Netherlands</publisher><subject>Artificial Intelligence ; CEC2017 functions ; Computational Intelligence ; Control ; Engineering ; Engineering problem ; Mathematical Logic and Foundations ; Mechatronics ; Multiverse optimization ; Research Article ; Robotics ; Slime mould algorithm ; Statistical tests</subject><ispartof>International journal of computational intelligence systems, 2024-12, Vol.17 (1), p.1-56</ispartof><rights>The Author(s) 2024</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Thakur, Gauri</creatorcontrib><creatorcontrib>Pal, Ashok</creatorcontrib><title>A Novel Slime Mould Multiverse Algorithm for Global Optimization and Mechanical Engineering Design Problems</title><title>International journal of computational intelligence systems</title><addtitle>Int J Comput Intell Syst</addtitle><description>The slime mould optimization algorithm (SMA) is one of the well-established optimization algorithms with a superior performance in a variety of real-life optimization problems. The SMA has certain limitations that reduce the diversity and accuracy of solutions, raising the risk of premature convergence with an inadequate balance between its exploitation and exploration phases. In this study, a novel hybrid slime mould multi-verse algorithm (SMMVA) is proposed to improve the performance of SMA algorithm. The SMA and multi-verse optimization (MVO) algorithm hybrid is introduced while updating variation parameter through novel nonlinear convergence factor. The proposed algorithm balances the ability of the SMA algorithm to explore and exploit, boosts the global exploration capability and improves the accuracy, stability, and convergence speed. The performance of SMMVA algorithm is compared with 16 well-established and recently-published metaheuristic algorithms on 23 standard benchmark functions, CEC2017, CEC2022 test functions, five engineering design problems, and five UCI repository datasets. The statistical tests such as Friedman’s test, box plot comparison and Wilcoxon rank sum test are employed to verify the SMMVA’s stability and statistical superiority. The algorithm was tested on total 64 benchmark functions, achieving an overall success rate of 68.75% across 30 runs compared to the other counterparts. The results for the feature selection problem show that the proposed algorithm with k-nearest neighbour (KNN) classifier obtained more informative features with higher accuracy values. Thus, the proposed SMMVA algorithm is proven to perform excellent performance in solving optimization problems with better solution accuracy and promising prospect.</description><subject>Artificial Intelligence</subject><subject>CEC2017 functions</subject><subject>Computational Intelligence</subject><subject>Control</subject><subject>Engineering</subject><subject>Engineering problem</subject><subject>Mathematical Logic and Foundations</subject><subject>Mechatronics</subject><subject>Multiverse optimization</subject><subject>Research Article</subject><subject>Robotics</subject><subject>Slime mould algorithm</subject><subject>Statistical tests</subject><issn>1875-6883</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>DOA</sourceid><recordid>eNotkN1q5DAMhU2h0DLtC-yVXyC7luPYyeUw2-0Wpj_Q7rWRYyXjWScenEyhffqmnYJA6Agdjj7GfoD4CUKYX5NS0OhCSFUso1CFOmOXUJuq0HVdXrDradoLISQoIZS6ZP_X_CG9UuTPMQzE79Mxen5_jHN4pTwRX8c-5TDvBt6lzG9jchj542EOQ3jHOaSR47gcULvDMbTL7mbsw0iUw9jz3zSFfuRPOblIw3TFzjuME11_9xX79-fmZfO32D7e3m3W28IDLIkb34B0jUaJotLQKAMN6NqVBrTDxpD3sgJSEmvndNf5FqiqEbvSdA49lSt2d_L1Cff2kMOA-c0mDPZLSLm3mOfQRrIdtLoxqpNOSkUloCJf1UYvam3KpVasPHlNh8-XKNt9OuZxiW9B2E_k9oTcLsjtF3Kryg--OHay</recordid><startdate>20241219</startdate><enddate>20241219</enddate><creator>Thakur, Gauri</creator><creator>Pal, Ashok</creator><general>Springer Netherlands</general><general>Springer</general><scope>C6C</scope><scope>DOA</scope></search><sort><creationdate>20241219</creationdate><title>A Novel Slime Mould Multiverse Algorithm for Global Optimization and Mechanical Engineering Design Problems</title><author>Thakur, Gauri ; Pal, Ashok</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-d1104-9d912b96a2a056194719168b3716ba97edd251e42a8bb6ffdc1e58aaf37fbade3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Artificial Intelligence</topic><topic>CEC2017 functions</topic><topic>Computational Intelligence</topic><topic>Control</topic><topic>Engineering</topic><topic>Engineering problem</topic><topic>Mathematical Logic and Foundations</topic><topic>Mechatronics</topic><topic>Multiverse optimization</topic><topic>Research Article</topic><topic>Robotics</topic><topic>Slime mould algorithm</topic><topic>Statistical tests</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Thakur, Gauri</creatorcontrib><creatorcontrib>Pal, Ashok</creatorcontrib><collection>SpringerOpen</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>International journal of computational intelligence systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Thakur, Gauri</au><au>Pal, Ashok</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Novel Slime Mould Multiverse Algorithm for Global Optimization and Mechanical Engineering Design Problems</atitle><jtitle>International journal of computational intelligence systems</jtitle><stitle>Int J Comput Intell Syst</stitle><date>2024-12-19</date><risdate>2024</risdate><volume>17</volume><issue>1</issue><spage>1</spage><epage>56</epage><pages>1-56</pages><eissn>1875-6883</eissn><abstract>The slime mould optimization algorithm (SMA) is one of the well-established optimization algorithms with a superior performance in a variety of real-life optimization problems. The SMA has certain limitations that reduce the diversity and accuracy of solutions, raising the risk of premature convergence with an inadequate balance between its exploitation and exploration phases. In this study, a novel hybrid slime mould multi-verse algorithm (SMMVA) is proposed to improve the performance of SMA algorithm. The SMA and multi-verse optimization (MVO) algorithm hybrid is introduced while updating variation parameter through novel nonlinear convergence factor. The proposed algorithm balances the ability of the SMA algorithm to explore and exploit, boosts the global exploration capability and improves the accuracy, stability, and convergence speed. The performance of SMMVA algorithm is compared with 16 well-established and recently-published metaheuristic algorithms on 23 standard benchmark functions, CEC2017, CEC2022 test functions, five engineering design problems, and five UCI repository datasets. The statistical tests such as Friedman’s test, box plot comparison and Wilcoxon rank sum test are employed to verify the SMMVA’s stability and statistical superiority. The algorithm was tested on total 64 benchmark functions, achieving an overall success rate of 68.75% across 30 runs compared to the other counterparts. The results for the feature selection problem show that the proposed algorithm with k-nearest neighbour (KNN) classifier obtained more informative features with higher accuracy values. Thus, the proposed SMMVA algorithm is proven to perform excellent performance in solving optimization problems with better solution accuracy and promising prospect.</abstract><cop>Dordrecht</cop><pub>Springer Netherlands</pub><doi>10.1007/s44196-024-00704-4</doi><tpages>56</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 1875-6883
ispartof International journal of computational intelligence systems, 2024-12, Vol.17 (1), p.1-56
issn 1875-6883
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_f1c6974f2b224e31a4ed5876c6987387
source Springer Nature - SpringerLink Journals - Fully Open Access
subjects Artificial Intelligence
CEC2017 functions
Computational Intelligence
Control
Engineering
Engineering problem
Mathematical Logic and Foundations
Mechatronics
Multiverse optimization
Research Article
Robotics
Slime mould algorithm
Statistical tests
title A Novel Slime Mould Multiverse Algorithm for Global Optimization and Mechanical Engineering Design Problems
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T19%3A42%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-doaj_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Novel%20Slime%20Mould%20Multiverse%20Algorithm%20for%20Global%20Optimization%20and%20Mechanical%20Engineering%20Design%20Problems&rft.jtitle=International%20journal%20of%20computational%20intelligence%20systems&rft.au=Thakur,%20Gauri&rft.date=2024-12-19&rft.volume=17&rft.issue=1&rft.spage=1&rft.epage=56&rft.pages=1-56&rft.eissn=1875-6883&rft_id=info:doi/10.1007/s44196-024-00704-4&rft_dat=%3Cdoaj_sprin%3Eoai_doaj_org_article_f1c6974f2b224e31a4ed5876c6987387%3C/doaj_sprin%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-d1104-9d912b96a2a056194719168b3716ba97edd251e42a8bb6ffdc1e58aaf37fbade3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true