Loading…
COLMA: a chaos-based mayfly algorithm with opposition-based learning and Levy flight for numerical optimization and engineering design
The Mayfly Algorithm (MA) is a widely used metaheuristic algorithm characterized by a simple structure with simple parameters. However, MA may have problems such as poor global search ability and tend to fall into local optima. To overcome these limitations, this paper presents a chaos-based mayfly...
Saved in:
Published in: | The Journal of supercomputing 2023-11, Vol.79 (17), p.19699-19745 |
---|---|
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-c319t-f993ad919286cc551b5bc181c7108fbd3a9129671c3f7427acff5e76cb0f1ccd3 |
---|---|
cites | cdi_FETCH-LOGICAL-c319t-f993ad919286cc551b5bc181c7108fbd3a9129671c3f7427acff5e76cb0f1ccd3 |
container_end_page | 19745 |
container_issue | 17 |
container_start_page | 19699 |
container_title | The Journal of supercomputing |
container_volume | 79 |
creator | Zhao, Yanpu Huang, Changsheng Zhang, Mengjie Lv, Cheng |
description | The Mayfly Algorithm (MA) is a widely used metaheuristic algorithm characterized by a simple structure with simple parameters. However, MA may have problems such as poor global search ability and tend to fall into local optima. To overcome these limitations, this paper presents a chaos-based mayfly algorithm with opposition-based learning and Levy flight (COLMA) to boost the global search and local exploitation performance. In COLMA, we first introduced tent chaos to optimize the initialization process of the mayfly population, as random initialization processes may result in low diversity of the mayfly population. In addition, the gravity coefficient has been replaced with an adaptive gravity coefficient to balance the global search ability and local exploitation ability during the iterative process of the algorithm. In the process of updating the position of the male mayfly population, an opposition-based learning strategy based on an iterative chaotic map with infinite collapses is adopted to prevent the male mayfly population from falling into local optima. At the same time, in order to solve the problem of small search range of female mayfly population, Levy flight strategy was introduced to replace random walk strategy. Finally, an offspring optimization strategy was proposed to increase the probability of the offspring mayfly population approaching the optimal solution. To verify the effectiveness and superiority of COLMA and the adopted strategy, experiments were conducted on the classical benchmark functions, CEC 2017 benchmark suite and CEC 2020 real-world constraint optimization problems, and the results were statistically tested using the Wilcoxon signed rank test and Friedman test. The analysis results show that the proposed COLMA has statistical validity and reliability and has great advantages compared with MA, variant MA in terms of optimization accuracy, stability and convergence speed. |
doi_str_mv | 10.1007/s11227-023-05400-2 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2871753073</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2871753073</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-f993ad919286cc551b5bc181c7108fbd3a9129671c3f7427acff5e76cb0f1ccd3</originalsourceid><addsrcrecordid>eNp9kMtOwzAQRS0EEqXwA6wssQ74kdQJu6riJQV1A2vLcezUVWIHOwWFD-C7cZtK7NjMaDT33NFcAK4xusUIsbuAMSEsQYQmKEsRSsgJmOGMxTHN01MwQwVBSZ6l5BxchLBFCKWU0Rn4Wa3L1-U9FFBuhAtJJYKqYSdG3Y5QtI3zZth08CtW6PreBTMYZ4-yVglvjW2gsDUs1ecIdWuazQC189DuOuWNFG3kBtOZb7EnD1JlG2NV3Ea0VsE09hKcadEGdXXsc_D--PC2ek7K9dPLalkmkuJiSHRRUFEXuCD5Qsosw1VWSZxjyTDKdVVTUWBSLBiWVLOUMCG1zhRbyAppLGVN5-Bm8u29-9ipMPCt23kbT3KSM8wyihiNKjKppHcheKV5700n_Mgx4vu8-ZQ3j3nzQ96cRIhOUOj3jyn_Z_0P9Qt4VoU4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2871753073</pqid></control><display><type>article</type><title>COLMA: a chaos-based mayfly algorithm with opposition-based learning and Levy flight for numerical optimization and engineering design</title><source>Springer Nature</source><creator>Zhao, Yanpu ; Huang, Changsheng ; Zhang, Mengjie ; Lv, Cheng</creator><creatorcontrib>Zhao, Yanpu ; Huang, Changsheng ; Zhang, Mengjie ; Lv, Cheng</creatorcontrib><description>The Mayfly Algorithm (MA) is a widely used metaheuristic algorithm characterized by a simple structure with simple parameters. However, MA may have problems such as poor global search ability and tend to fall into local optima. To overcome these limitations, this paper presents a chaos-based mayfly algorithm with opposition-based learning and Levy flight (COLMA) to boost the global search and local exploitation performance. In COLMA, we first introduced tent chaos to optimize the initialization process of the mayfly population, as random initialization processes may result in low diversity of the mayfly population. In addition, the gravity coefficient has been replaced with an adaptive gravity coefficient to balance the global search ability and local exploitation ability during the iterative process of the algorithm. In the process of updating the position of the male mayfly population, an opposition-based learning strategy based on an iterative chaotic map with infinite collapses is adopted to prevent the male mayfly population from falling into local optima. At the same time, in order to solve the problem of small search range of female mayfly population, Levy flight strategy was introduced to replace random walk strategy. Finally, an offspring optimization strategy was proposed to increase the probability of the offspring mayfly population approaching the optimal solution. To verify the effectiveness and superiority of COLMA and the adopted strategy, experiments were conducted on the classical benchmark functions, CEC 2017 benchmark suite and CEC 2020 real-world constraint optimization problems, and the results were statistically tested using the Wilcoxon signed rank test and Friedman test. The analysis results show that the proposed COLMA has statistical validity and reliability and has great advantages compared with MA, variant MA in terms of optimization accuracy, stability and convergence speed.</description><identifier>ISSN: 0920-8542</identifier><identifier>EISSN: 1573-0484</identifier><identifier>DOI: 10.1007/s11227-023-05400-2</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Benchmarks ; Compilers ; Computer Science ; Design engineering ; Design optimization ; Exploitation ; Heuristic methods ; Interpreters ; Iterative methods ; Machine learning ; Males ; Optimization ; Processor Architectures ; Programming Languages ; Random walk ; Rank tests ; Searching ; Statistical analysis</subject><ispartof>The Journal of supercomputing, 2023-11, Vol.79 (17), p.19699-19745</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-f993ad919286cc551b5bc181c7108fbd3a9129671c3f7427acff5e76cb0f1ccd3</citedby><cites>FETCH-LOGICAL-c319t-f993ad919286cc551b5bc181c7108fbd3a9129671c3f7427acff5e76cb0f1ccd3</cites></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>Zhao, Yanpu</creatorcontrib><creatorcontrib>Huang, Changsheng</creatorcontrib><creatorcontrib>Zhang, Mengjie</creatorcontrib><creatorcontrib>Lv, Cheng</creatorcontrib><title>COLMA: a chaos-based mayfly algorithm with opposition-based learning and Levy flight for numerical optimization and engineering design</title><title>The Journal of supercomputing</title><addtitle>J Supercomput</addtitle><description>The Mayfly Algorithm (MA) is a widely used metaheuristic algorithm characterized by a simple structure with simple parameters. However, MA may have problems such as poor global search ability and tend to fall into local optima. To overcome these limitations, this paper presents a chaos-based mayfly algorithm with opposition-based learning and Levy flight (COLMA) to boost the global search and local exploitation performance. In COLMA, we first introduced tent chaos to optimize the initialization process of the mayfly population, as random initialization processes may result in low diversity of the mayfly population. In addition, the gravity coefficient has been replaced with an adaptive gravity coefficient to balance the global search ability and local exploitation ability during the iterative process of the algorithm. In the process of updating the position of the male mayfly population, an opposition-based learning strategy based on an iterative chaotic map with infinite collapses is adopted to prevent the male mayfly population from falling into local optima. At the same time, in order to solve the problem of small search range of female mayfly population, Levy flight strategy was introduced to replace random walk strategy. Finally, an offspring optimization strategy was proposed to increase the probability of the offspring mayfly population approaching the optimal solution. To verify the effectiveness and superiority of COLMA and the adopted strategy, experiments were conducted on the classical benchmark functions, CEC 2017 benchmark suite and CEC 2020 real-world constraint optimization problems, and the results were statistically tested using the Wilcoxon signed rank test and Friedman test. The analysis results show that the proposed COLMA has statistical validity and reliability and has great advantages compared with MA, variant MA in terms of optimization accuracy, stability and convergence speed.</description><subject>Algorithms</subject><subject>Benchmarks</subject><subject>Compilers</subject><subject>Computer Science</subject><subject>Design engineering</subject><subject>Design optimization</subject><subject>Exploitation</subject><subject>Heuristic methods</subject><subject>Interpreters</subject><subject>Iterative methods</subject><subject>Machine learning</subject><subject>Males</subject><subject>Optimization</subject><subject>Processor Architectures</subject><subject>Programming Languages</subject><subject>Random walk</subject><subject>Rank tests</subject><subject>Searching</subject><subject>Statistical analysis</subject><issn>0920-8542</issn><issn>1573-0484</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNp9kMtOwzAQRS0EEqXwA6wssQ74kdQJu6riJQV1A2vLcezUVWIHOwWFD-C7cZtK7NjMaDT33NFcAK4xusUIsbuAMSEsQYQmKEsRSsgJmOGMxTHN01MwQwVBSZ6l5BxchLBFCKWU0Rn4Wa3L1-U9FFBuhAtJJYKqYSdG3Y5QtI3zZth08CtW6PreBTMYZ4-yVglvjW2gsDUs1ecIdWuazQC189DuOuWNFG3kBtOZb7EnD1JlG2NV3Ea0VsE09hKcadEGdXXsc_D--PC2ek7K9dPLalkmkuJiSHRRUFEXuCD5Qsosw1VWSZxjyTDKdVVTUWBSLBiWVLOUMCG1zhRbyAppLGVN5-Bm8u29-9ipMPCt23kbT3KSM8wyihiNKjKppHcheKV5700n_Mgx4vu8-ZQ3j3nzQ96cRIhOUOj3jyn_Z_0P9Qt4VoU4</recordid><startdate>20231101</startdate><enddate>20231101</enddate><creator>Zhao, Yanpu</creator><creator>Huang, Changsheng</creator><creator>Zhang, Mengjie</creator><creator>Lv, Cheng</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20231101</creationdate><title>COLMA: a chaos-based mayfly algorithm with opposition-based learning and Levy flight for numerical optimization and engineering design</title><author>Zhao, Yanpu ; Huang, Changsheng ; Zhang, Mengjie ; Lv, Cheng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-f993ad919286cc551b5bc181c7108fbd3a9129671c3f7427acff5e76cb0f1ccd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Benchmarks</topic><topic>Compilers</topic><topic>Computer Science</topic><topic>Design engineering</topic><topic>Design optimization</topic><topic>Exploitation</topic><topic>Heuristic methods</topic><topic>Interpreters</topic><topic>Iterative methods</topic><topic>Machine learning</topic><topic>Males</topic><topic>Optimization</topic><topic>Processor Architectures</topic><topic>Programming Languages</topic><topic>Random walk</topic><topic>Rank tests</topic><topic>Searching</topic><topic>Statistical analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhao, Yanpu</creatorcontrib><creatorcontrib>Huang, Changsheng</creatorcontrib><creatorcontrib>Zhang, Mengjie</creatorcontrib><creatorcontrib>Lv, Cheng</creatorcontrib><collection>CrossRef</collection><jtitle>The Journal of supercomputing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhao, Yanpu</au><au>Huang, Changsheng</au><au>Zhang, Mengjie</au><au>Lv, Cheng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>COLMA: a chaos-based mayfly algorithm with opposition-based learning and Levy flight for numerical optimization and engineering design</atitle><jtitle>The Journal of supercomputing</jtitle><stitle>J Supercomput</stitle><date>2023-11-01</date><risdate>2023</risdate><volume>79</volume><issue>17</issue><spage>19699</spage><epage>19745</epage><pages>19699-19745</pages><issn>0920-8542</issn><eissn>1573-0484</eissn><abstract>The Mayfly Algorithm (MA) is a widely used metaheuristic algorithm characterized by a simple structure with simple parameters. However, MA may have problems such as poor global search ability and tend to fall into local optima. To overcome these limitations, this paper presents a chaos-based mayfly algorithm with opposition-based learning and Levy flight (COLMA) to boost the global search and local exploitation performance. In COLMA, we first introduced tent chaos to optimize the initialization process of the mayfly population, as random initialization processes may result in low diversity of the mayfly population. In addition, the gravity coefficient has been replaced with an adaptive gravity coefficient to balance the global search ability and local exploitation ability during the iterative process of the algorithm. In the process of updating the position of the male mayfly population, an opposition-based learning strategy based on an iterative chaotic map with infinite collapses is adopted to prevent the male mayfly population from falling into local optima. At the same time, in order to solve the problem of small search range of female mayfly population, Levy flight strategy was introduced to replace random walk strategy. Finally, an offspring optimization strategy was proposed to increase the probability of the offspring mayfly population approaching the optimal solution. To verify the effectiveness and superiority of COLMA and the adopted strategy, experiments were conducted on the classical benchmark functions, CEC 2017 benchmark suite and CEC 2020 real-world constraint optimization problems, and the results were statistically tested using the Wilcoxon signed rank test and Friedman test. The analysis results show that the proposed COLMA has statistical validity and reliability and has great advantages compared with MA, variant MA in terms of optimization accuracy, stability and convergence speed.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11227-023-05400-2</doi><tpages>47</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0920-8542 |
ispartof | The Journal of supercomputing, 2023-11, Vol.79 (17), p.19699-19745 |
issn | 0920-8542 1573-0484 |
language | eng |
recordid | cdi_proquest_journals_2871753073 |
source | Springer Nature |
subjects | Algorithms Benchmarks Compilers Computer Science Design engineering Design optimization Exploitation Heuristic methods Interpreters Iterative methods Machine learning Males Optimization Processor Architectures Programming Languages Random walk Rank tests Searching Statistical analysis |
title | COLMA: a chaos-based mayfly algorithm with opposition-based learning and Levy flight for numerical optimization and engineering design |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T23%3A39%3A47IST&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=COLMA:%20a%20chaos-based%20mayfly%20algorithm%20with%20opposition-based%20learning%20and%20Levy%20flight%20for%20numerical%20optimization%20and%20engineering%20design&rft.jtitle=The%20Journal%20of%20supercomputing&rft.au=Zhao,%20Yanpu&rft.date=2023-11-01&rft.volume=79&rft.issue=17&rft.spage=19699&rft.epage=19745&rft.pages=19699-19745&rft.issn=0920-8542&rft.eissn=1573-0484&rft_id=info:doi/10.1007/s11227-023-05400-2&rft_dat=%3Cproquest_cross%3E2871753073%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c319t-f993ad919286cc551b5bc181c7108fbd3a9129671c3f7427acff5e76cb0f1ccd3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2871753073&rft_id=info:pmid/&rfr_iscdi=true |