A quantum-based sine cosine algorithm for solving general systems of nonlinear equations
In this paper, a quantum-based sine cosine algorithm, named as Q-SCA, is proposed for solving general systems of nonlinear equations. The Q-SCA hybridizes the sine cosine algorithm (SCA) with quantum local search (QLS) for enhancing the diversity of solutions and preventing local optima entrapment....
Gespeichert in:
Veröffentlicht in: | The Artificial intelligence review 2021-06, Vol.54 (5), p.3939-3990 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 3990 |
---|---|
container_issue | 5 |
container_start_page | 3939 |
container_title | The Artificial intelligence review |
container_volume | 54 |
creator | Rizk-Allah, Rizk M. |
description | In this paper, a quantum-based sine cosine algorithm, named as Q-SCA, is proposed for solving general systems of nonlinear equations. The Q-SCA hybridizes the sine cosine algorithm (SCA) with quantum local search (QLS) for enhancing the diversity of solutions and preventing local optima entrapment. The essence of the proposed Q-SCA is to speed up the optimum searching operation and to accelerate the convergence characteristic. The proposed Q-SCA works in twofold: firstly, an improved version of SCA based on tuning the search space around the destination solution dynamically, so that the search space is shrunken gradually as the optima are attained. In addition, a new mechanism to update the solutions is introduced using bidirectional equations. Secondly, QLS is incorporated to improve the quality of the obtained solutions by the SCA phase. By this methodology, the proposed Q-SCA can achieve high levels of exploration/exploitation and precise stable convergence to high-quality solutions. The performance of the proposed algorithm is assessed by adopting twelve systems of nonlinear equations and two electrical applications. Furthermore, the proposed Q-SCA algorithm is applied on expensive large-scale problems including CEC 2017 benchmark and realistic optimal power dispatch (OPD) to confirm its scalability. Experimental results affirm that the Q-SCA is performs steadily, and it has a promising overall performance among several compared algorithms. |
doi_str_mv | 10.1007/s10462-020-09944-0 |
format | Article |
fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_2531422287</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A718215032</galeid><sourcerecordid>A718215032</sourcerecordid><originalsourceid>FETCH-LOGICAL-c358t-6e50243c1b40e525925f68be20f0f2ec10278004dd085952f2ff5eda1168c703</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouH78AU8Bz9HJtOnHcVn8ggUve_AWsu2kdmmT3aQr-O-NVvAmOQwM7zN5eRi7kXAnAcr7KCEvUACCgLrOcwEnbCFVmYky7U_ZArCoBVYoz9lFjDsAUJhnC_a25IejcdNxFFsTqeWxd8Qb_zPM0PnQT-8jtz7w6IeP3nW8I0fBDDx-xonGyL3lzrshASZwStem3rt4xc6sGSJd_85Ltnl82Kyexfr16WW1XIsmU9UkClKQijRymwMpVDUqW1RbQrBgkRoJWFYAedtCpWqFFq1V1Bopi6opIbtkt_PZffCHI8VJ7_wxuPSjRpXJHBGrMqXu5lRnBtK9s34KpkmvpbFvvCPbp_2ylEmQggwTgDPQBB9jIKv3oR9N-NQS9LdxPRvXybj-Ma6_u2QzFFPYdRT-uvxDfQEaUYMn</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2531422287</pqid></control><display><type>article</type><title>A quantum-based sine cosine algorithm for solving general systems of nonlinear equations</title><source>Springer Nature - Complete Springer Journals</source><creator>Rizk-Allah, Rizk M.</creator><creatorcontrib>Rizk-Allah, Rizk M.</creatorcontrib><description>In this paper, a quantum-based sine cosine algorithm, named as Q-SCA, is proposed for solving general systems of nonlinear equations. The Q-SCA hybridizes the sine cosine algorithm (SCA) with quantum local search (QLS) for enhancing the diversity of solutions and preventing local optima entrapment. The essence of the proposed Q-SCA is to speed up the optimum searching operation and to accelerate the convergence characteristic. The proposed Q-SCA works in twofold: firstly, an improved version of SCA based on tuning the search space around the destination solution dynamically, so that the search space is shrunken gradually as the optima are attained. In addition, a new mechanism to update the solutions is introduced using bidirectional equations. Secondly, QLS is incorporated to improve the quality of the obtained solutions by the SCA phase. By this methodology, the proposed Q-SCA can achieve high levels of exploration/exploitation and precise stable convergence to high-quality solutions. The performance of the proposed algorithm is assessed by adopting twelve systems of nonlinear equations and two electrical applications. Furthermore, the proposed Q-SCA algorithm is applied on expensive large-scale problems including CEC 2017 benchmark and realistic optimal power dispatch (OPD) to confirm its scalability. Experimental results affirm that the Q-SCA is performs steadily, and it has a promising overall performance among several compared algorithms.</description><identifier>ISSN: 0269-2821</identifier><identifier>EISSN: 1573-7462</identifier><identifier>DOI: 10.1007/s10462-020-09944-0</identifier><language>eng</language><publisher>Dordrecht: Springer Netherlands</publisher><subject>Algorithms ; Artificial Intelligence ; Computer Science ; Convergence ; Entrapment ; Mathematical analysis ; Nonlinear equations ; Nonlinear systems ; Optimization ; Power dispatch ; Searching ; Trigonometric functions</subject><ispartof>The Artificial intelligence review, 2021-06, Vol.54 (5), p.3939-3990</ispartof><rights>The Author(s), under exclusive licence to Springer Nature B.V. part of Springer Nature 2021</rights><rights>COPYRIGHT 2021 Springer</rights><rights>The Author(s), under exclusive licence to Springer Nature B.V. part of Springer Nature 2021.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c358t-6e50243c1b40e525925f68be20f0f2ec10278004dd085952f2ff5eda1168c703</citedby><cites>FETCH-LOGICAL-c358t-6e50243c1b40e525925f68be20f0f2ec10278004dd085952f2ff5eda1168c703</cites><orcidid>0000-0002-1553-0130</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10462-020-09944-0$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10462-020-09944-0$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Rizk-Allah, Rizk M.</creatorcontrib><title>A quantum-based sine cosine algorithm for solving general systems of nonlinear equations</title><title>The Artificial intelligence review</title><addtitle>Artif Intell Rev</addtitle><description>In this paper, a quantum-based sine cosine algorithm, named as Q-SCA, is proposed for solving general systems of nonlinear equations. The Q-SCA hybridizes the sine cosine algorithm (SCA) with quantum local search (QLS) for enhancing the diversity of solutions and preventing local optima entrapment. The essence of the proposed Q-SCA is to speed up the optimum searching operation and to accelerate the convergence characteristic. The proposed Q-SCA works in twofold: firstly, an improved version of SCA based on tuning the search space around the destination solution dynamically, so that the search space is shrunken gradually as the optima are attained. In addition, a new mechanism to update the solutions is introduced using bidirectional equations. Secondly, QLS is incorporated to improve the quality of the obtained solutions by the SCA phase. By this methodology, the proposed Q-SCA can achieve high levels of exploration/exploitation and precise stable convergence to high-quality solutions. The performance of the proposed algorithm is assessed by adopting twelve systems of nonlinear equations and two electrical applications. Furthermore, the proposed Q-SCA algorithm is applied on expensive large-scale problems including CEC 2017 benchmark and realistic optimal power dispatch (OPD) to confirm its scalability. Experimental results affirm that the Q-SCA is performs steadily, and it has a promising overall performance among several compared algorithms.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Computer Science</subject><subject>Convergence</subject><subject>Entrapment</subject><subject>Mathematical analysis</subject><subject>Nonlinear equations</subject><subject>Nonlinear systems</subject><subject>Optimization</subject><subject>Power dispatch</subject><subject>Searching</subject><subject>Trigonometric functions</subject><issn>0269-2821</issn><issn>1573-7462</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp9kE1LxDAQhoMouH78AU8Bz9HJtOnHcVn8ggUve_AWsu2kdmmT3aQr-O-NVvAmOQwM7zN5eRi7kXAnAcr7KCEvUACCgLrOcwEnbCFVmYky7U_ZArCoBVYoz9lFjDsAUJhnC_a25IejcdNxFFsTqeWxd8Qb_zPM0PnQT-8jtz7w6IeP3nW8I0fBDDx-xonGyL3lzrshASZwStem3rt4xc6sGSJd_85Ltnl82Kyexfr16WW1XIsmU9UkClKQijRymwMpVDUqW1RbQrBgkRoJWFYAedtCpWqFFq1V1Bopi6opIbtkt_PZffCHI8VJ7_wxuPSjRpXJHBGrMqXu5lRnBtK9s34KpkmvpbFvvCPbp_2ylEmQggwTgDPQBB9jIKv3oR9N-NQS9LdxPRvXybj-Ma6_u2QzFFPYdRT-uvxDfQEaUYMn</recordid><startdate>20210601</startdate><enddate>20210601</enddate><creator>Rizk-Allah, Rizk M.</creator><general>Springer Netherlands</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ALSLI</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CNYFK</scope><scope>DWQXO</scope><scope>E3H</scope><scope>F2A</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M1O</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PSYQQ</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-1553-0130</orcidid></search><sort><creationdate>20210601</creationdate><title>A quantum-based sine cosine algorithm for solving general systems of nonlinear equations</title><author>Rizk-Allah, Rizk M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c358t-6e50243c1b40e525925f68be20f0f2ec10278004dd085952f2ff5eda1168c703</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Computer Science</topic><topic>Convergence</topic><topic>Entrapment</topic><topic>Mathematical analysis</topic><topic>Nonlinear equations</topic><topic>Nonlinear systems</topic><topic>Optimization</topic><topic>Power dispatch</topic><topic>Searching</topic><topic>Trigonometric functions</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rizk-Allah, Rizk M.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Social Science Premium Collection</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Library & Information Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Library Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</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><collection>ProQuest One Psychology</collection><collection>ProQuest Central Basic</collection><jtitle>The Artificial intelligence review</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rizk-Allah, Rizk M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A quantum-based sine cosine algorithm for solving general systems of nonlinear equations</atitle><jtitle>The Artificial intelligence review</jtitle><stitle>Artif Intell Rev</stitle><date>2021-06-01</date><risdate>2021</risdate><volume>54</volume><issue>5</issue><spage>3939</spage><epage>3990</epage><pages>3939-3990</pages><issn>0269-2821</issn><eissn>1573-7462</eissn><abstract>In this paper, a quantum-based sine cosine algorithm, named as Q-SCA, is proposed for solving general systems of nonlinear equations. The Q-SCA hybridizes the sine cosine algorithm (SCA) with quantum local search (QLS) for enhancing the diversity of solutions and preventing local optima entrapment. The essence of the proposed Q-SCA is to speed up the optimum searching operation and to accelerate the convergence characteristic. The proposed Q-SCA works in twofold: firstly, an improved version of SCA based on tuning the search space around the destination solution dynamically, so that the search space is shrunken gradually as the optima are attained. In addition, a new mechanism to update the solutions is introduced using bidirectional equations. Secondly, QLS is incorporated to improve the quality of the obtained solutions by the SCA phase. By this methodology, the proposed Q-SCA can achieve high levels of exploration/exploitation and precise stable convergence to high-quality solutions. The performance of the proposed algorithm is assessed by adopting twelve systems of nonlinear equations and two electrical applications. Furthermore, the proposed Q-SCA algorithm is applied on expensive large-scale problems including CEC 2017 benchmark and realistic optimal power dispatch (OPD) to confirm its scalability. Experimental results affirm that the Q-SCA is performs steadily, and it has a promising overall performance among several compared algorithms.</abstract><cop>Dordrecht</cop><pub>Springer Netherlands</pub><doi>10.1007/s10462-020-09944-0</doi><tpages>52</tpages><orcidid>https://orcid.org/0000-0002-1553-0130</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0269-2821 |
ispartof | The Artificial intelligence review, 2021-06, Vol.54 (5), p.3939-3990 |
issn | 0269-2821 1573-7462 |
language | eng |
recordid | cdi_proquest_journals_2531422287 |
source | Springer Nature - Complete Springer Journals |
subjects | Algorithms Artificial Intelligence Computer Science Convergence Entrapment Mathematical analysis Nonlinear equations Nonlinear systems Optimization Power dispatch Searching Trigonometric functions |
title | A quantum-based sine cosine algorithm for solving general systems of nonlinear equations |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T03%3A08%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20quantum-based%20sine%20cosine%20algorithm%20for%20solving%20general%20systems%20of%20nonlinear%20equations&rft.jtitle=The%20Artificial%20intelligence%20review&rft.au=Rizk-Allah,%20Rizk%20M.&rft.date=2021-06-01&rft.volume=54&rft.issue=5&rft.spage=3939&rft.epage=3990&rft.pages=3939-3990&rft.issn=0269-2821&rft.eissn=1573-7462&rft_id=info:doi/10.1007/s10462-020-09944-0&rft_dat=%3Cgale_proqu%3EA718215032%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2531422287&rft_id=info:pmid/&rft_galeid=A718215032&rfr_iscdi=true |