Find optimal capacity and location of distributed generation units in radial distribution networks by using enhanced coyote optimization algorithm
This paper proposes a novel effective optimization algorithm called enhanced coyote optimization algorithm (ECOA). This proposed method is applied to optimally select the position and capacity of distributed generators (DGs) in radial distribution networks. It is a multi-objective optimization probl...
Gespeichert in:
Veröffentlicht in: | Neural computing & applications 2021-05, Vol.33 (9), p.4343-4371 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 4371 |
---|---|
container_issue | 9 |
container_start_page | 4343 |
container_title | Neural computing & applications |
container_volume | 33 |
creator | Pham, Thai Dinh Nguyen, Thang Trung Dinh, Bach Hoang |
description | This paper proposes a novel effective optimization algorithm called enhanced coyote optimization algorithm (ECOA). This proposed method is applied to optimally select the position and capacity of distributed generators (DGs) in radial distribution networks. It is a multi-objective optimization problem where properly installing DGs should simultaneously reduce the power loss, operating costs as well as improve voltage stability. Based on the original coyote optimization algorithm (COA), ECOA is developed to be able to expand the search area and retain a good solution group in each generation. It includes two modifications to improve the efficiency of the original COA approach where the first one is replacing the central solution by the best current solution in the first new solution generation technique and the second focuses on reducing the computation burden and process time in the second new solution generation step. In this research, various experiments have been implemented by applying ECOA, COA as well as salp swarm algorithm (SSA), Sunflower optimization (SOA) for three IEEE radial distribution power networks with 33, 69 and 85 buses. Obtained results have been statistically analyzed to investigate the appropriate control parameters and to verify the performance of the proposed ECOA method. In addition, the performance of ECOA is also compared to various similar meta-heuristic methods such as genetic algorithm (GA), particle swarm optimization (PSO), hybrid genetic algorithm and particle swarm optimization (HGA-PSO), simulated annealing, bacterial foraging optimization algorithm, backtracking search optimization algorithm, harmony search algorithm, whale optimization algorithm (WOA) and combined power loss index-whale optimization algorithm (PLI-WOA). Detailed comparisons show that ECOA can determine more effective location and size of DGs with faster speed than other methods. Specifically, the improvement levels of the proposed method over compared to SFO, SSA, and COA can be up to 2.1978%, 0.7858% and 0.2348%. Furthermore, as compared to other existing methods in references, ECOA achieves the significant improvements which are up to 31.7491%, 20.2143% and 22.7213% for the three test systems, respectively. Thus, the proposed method is a favorable method in solving the optimal determination of DGs in radial distribution networks. |
doi_str_mv | 10.1007/s00521-020-05239-1 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2516609780</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2516609780</sourcerecordid><originalsourceid>FETCH-LOGICAL-c372t-c0e25ecfbd07f5bb904f00cde69e1ed5cdf64a5d453ac915c14f6bf7d22edaf43</originalsourceid><addsrcrecordid>eNp9kM1KAzEQx4MoWKsv4CngeXWySXa7RxGrQsGLnkM2H21qTWqSRepj-MSmrujN0wzz_xj4IXRO4JIAtFcJgNekghqqstCuIgdoQhilFQU-O0QT6FiRG0aP0UlKawBgzYxP0OfceY3DNrtXucFKbqVyeYdlOW6CktkFj4PF2qUcXT9ko_HSeBNHZfAuJ-w8jlK7kv-17UVv8nuILwn3Ozwk55fY-JX0qlSosAvZjG_dx9glN8sQXV69nqIjKzfJnP3MKXqe3z7d3FeLx7uHm-tFpWhb50qBqblRttfQWt73HTALoLRpOkOM5krbhkmuGadSdYQrwmzT21bXtdHSMjpFF2PvNoa3waQs1mGIvrwUNSdNA107g-KqR5eKIaVorNjGwiruBAGxZy9G9qKwF9_sBSkhOoZSMfuliX_V_6S-ABMujKY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2516609780</pqid></control><display><type>article</type><title>Find optimal capacity and location of distributed generation units in radial distribution networks by using enhanced coyote optimization algorithm</title><source>SpringerNature Journals</source><creator>Pham, Thai Dinh ; Nguyen, Thang Trung ; Dinh, Bach Hoang</creator><creatorcontrib>Pham, Thai Dinh ; Nguyen, Thang Trung ; Dinh, Bach Hoang</creatorcontrib><description>This paper proposes a novel effective optimization algorithm called enhanced coyote optimization algorithm (ECOA). This proposed method is applied to optimally select the position and capacity of distributed generators (DGs) in radial distribution networks. It is a multi-objective optimization problem where properly installing DGs should simultaneously reduce the power loss, operating costs as well as improve voltage stability. Based on the original coyote optimization algorithm (COA), ECOA is developed to be able to expand the search area and retain a good solution group in each generation. It includes two modifications to improve the efficiency of the original COA approach where the first one is replacing the central solution by the best current solution in the first new solution generation technique and the second focuses on reducing the computation burden and process time in the second new solution generation step. In this research, various experiments have been implemented by applying ECOA, COA as well as salp swarm algorithm (SSA), Sunflower optimization (SOA) for three IEEE radial distribution power networks with 33, 69 and 85 buses. Obtained results have been statistically analyzed to investigate the appropriate control parameters and to verify the performance of the proposed ECOA method. In addition, the performance of ECOA is also compared to various similar meta-heuristic methods such as genetic algorithm (GA), particle swarm optimization (PSO), hybrid genetic algorithm and particle swarm optimization (HGA-PSO), simulated annealing, bacterial foraging optimization algorithm, backtracking search optimization algorithm, harmony search algorithm, whale optimization algorithm (WOA) and combined power loss index-whale optimization algorithm (PLI-WOA). Detailed comparisons show that ECOA can determine more effective location and size of DGs with faster speed than other methods. Specifically, the improvement levels of the proposed method over compared to SFO, SSA, and COA can be up to 2.1978%, 0.7858% and 0.2348%. Furthermore, as compared to other existing methods in references, ECOA achieves the significant improvements which are up to 31.7491%, 20.2143% and 22.7213% for the three test systems, respectively. Thus, the proposed method is a favorable method in solving the optimal determination of DGs in radial distribution networks.</description><identifier>ISSN: 0941-0643</identifier><identifier>EISSN: 1433-3058</identifier><identifier>DOI: 10.1007/s00521-020-05239-1</identifier><language>eng</language><publisher>London: Springer London</publisher><subject>Artificial Intelligence ; Computational Biology/Bioinformatics ; Computational Science and Engineering ; Computer Science ; Data Mining and Knowledge Discovery ; Distributed generation ; Electric power distribution ; Genetic algorithms ; Heuristic methods ; Image Processing and Computer Vision ; Multiple objective analysis ; Networks ; Optimization algorithms ; Original Article ; Particle swarm optimization ; Probability and Statistics in Computer Science ; Radial distribution ; Search algorithms ; Simulated annealing ; Sunflowers ; Voltage stability</subject><ispartof>Neural computing & applications, 2021-05, Vol.33 (9), p.4343-4371</ispartof><rights>Springer-Verlag London Ltd., part of Springer Nature 2020</rights><rights>Springer-Verlag London Ltd., part of Springer Nature 2020.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c372t-c0e25ecfbd07f5bb904f00cde69e1ed5cdf64a5d453ac915c14f6bf7d22edaf43</citedby><cites>FETCH-LOGICAL-c372t-c0e25ecfbd07f5bb904f00cde69e1ed5cdf64a5d453ac915c14f6bf7d22edaf43</cites><orcidid>0000-0002-0951-410X</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/s00521-020-05239-1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00521-020-05239-1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Pham, Thai Dinh</creatorcontrib><creatorcontrib>Nguyen, Thang Trung</creatorcontrib><creatorcontrib>Dinh, Bach Hoang</creatorcontrib><title>Find optimal capacity and location of distributed generation units in radial distribution networks by using enhanced coyote optimization algorithm</title><title>Neural computing & applications</title><addtitle>Neural Comput & Applic</addtitle><description>This paper proposes a novel effective optimization algorithm called enhanced coyote optimization algorithm (ECOA). This proposed method is applied to optimally select the position and capacity of distributed generators (DGs) in radial distribution networks. It is a multi-objective optimization problem where properly installing DGs should simultaneously reduce the power loss, operating costs as well as improve voltage stability. Based on the original coyote optimization algorithm (COA), ECOA is developed to be able to expand the search area and retain a good solution group in each generation. It includes two modifications to improve the efficiency of the original COA approach where the first one is replacing the central solution by the best current solution in the first new solution generation technique and the second focuses on reducing the computation burden and process time in the second new solution generation step. In this research, various experiments have been implemented by applying ECOA, COA as well as salp swarm algorithm (SSA), Sunflower optimization (SOA) for three IEEE radial distribution power networks with 33, 69 and 85 buses. Obtained results have been statistically analyzed to investigate the appropriate control parameters and to verify the performance of the proposed ECOA method. In addition, the performance of ECOA is also compared to various similar meta-heuristic methods such as genetic algorithm (GA), particle swarm optimization (PSO), hybrid genetic algorithm and particle swarm optimization (HGA-PSO), simulated annealing, bacterial foraging optimization algorithm, backtracking search optimization algorithm, harmony search algorithm, whale optimization algorithm (WOA) and combined power loss index-whale optimization algorithm (PLI-WOA). Detailed comparisons show that ECOA can determine more effective location and size of DGs with faster speed than other methods. Specifically, the improvement levels of the proposed method over compared to SFO, SSA, and COA can be up to 2.1978%, 0.7858% and 0.2348%. Furthermore, as compared to other existing methods in references, ECOA achieves the significant improvements which are up to 31.7491%, 20.2143% and 22.7213% for the three test systems, respectively. Thus, the proposed method is a favorable method in solving the optimal determination of DGs in radial distribution networks.</description><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>Distributed generation</subject><subject>Electric power distribution</subject><subject>Genetic algorithms</subject><subject>Heuristic methods</subject><subject>Image Processing and Computer Vision</subject><subject>Multiple objective analysis</subject><subject>Networks</subject><subject>Optimization algorithms</subject><subject>Original Article</subject><subject>Particle swarm optimization</subject><subject>Probability and Statistics in Computer Science</subject><subject>Radial distribution</subject><subject>Search algorithms</subject><subject>Simulated annealing</subject><subject>Sunflowers</subject><subject>Voltage stability</subject><issn>0941-0643</issn><issn>1433-3058</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNp9kM1KAzEQx4MoWKsv4CngeXWySXa7RxGrQsGLnkM2H21qTWqSRepj-MSmrujN0wzz_xj4IXRO4JIAtFcJgNekghqqstCuIgdoQhilFQU-O0QT6FiRG0aP0UlKawBgzYxP0OfceY3DNrtXucFKbqVyeYdlOW6CktkFj4PF2qUcXT9ko_HSeBNHZfAuJ-w8jlK7kv-17UVv8nuILwn3Ozwk55fY-JX0qlSosAvZjG_dx9glN8sQXV69nqIjKzfJnP3MKXqe3z7d3FeLx7uHm-tFpWhb50qBqblRttfQWt73HTALoLRpOkOM5krbhkmuGadSdYQrwmzT21bXtdHSMjpFF2PvNoa3waQs1mGIvrwUNSdNA107g-KqR5eKIaVorNjGwiruBAGxZy9G9qKwF9_sBSkhOoZSMfuliX_V_6S-ABMujKY</recordid><startdate>20210501</startdate><enddate>20210501</enddate><creator>Pham, Thai Dinh</creator><creator>Nguyen, Thang Trung</creator><creator>Dinh, Bach Hoang</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><orcidid>https://orcid.org/0000-0002-0951-410X</orcidid></search><sort><creationdate>20210501</creationdate><title>Find optimal capacity and location of distributed generation units in radial distribution networks by using enhanced coyote optimization algorithm</title><author>Pham, Thai Dinh ; Nguyen, Thang Trung ; Dinh, Bach Hoang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c372t-c0e25ecfbd07f5bb904f00cde69e1ed5cdf64a5d453ac915c14f6bf7d22edaf43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><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>Distributed generation</topic><topic>Electric power distribution</topic><topic>Genetic algorithms</topic><topic>Heuristic methods</topic><topic>Image Processing and Computer Vision</topic><topic>Multiple objective analysis</topic><topic>Networks</topic><topic>Optimization algorithms</topic><topic>Original Article</topic><topic>Particle swarm optimization</topic><topic>Probability and Statistics in Computer Science</topic><topic>Radial distribution</topic><topic>Search algorithms</topic><topic>Simulated annealing</topic><topic>Sunflowers</topic><topic>Voltage stability</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pham, Thai Dinh</creatorcontrib><creatorcontrib>Nguyen, Thang Trung</creatorcontrib><creatorcontrib>Dinh, Bach Hoang</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>Advanced Technologies & Aerospace Database</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>Pham, Thai Dinh</au><au>Nguyen, Thang Trung</au><au>Dinh, Bach Hoang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Find optimal capacity and location of distributed generation units in radial distribution networks by using enhanced coyote optimization algorithm</atitle><jtitle>Neural computing & applications</jtitle><stitle>Neural Comput & Applic</stitle><date>2021-05-01</date><risdate>2021</risdate><volume>33</volume><issue>9</issue><spage>4343</spage><epage>4371</epage><pages>4343-4371</pages><issn>0941-0643</issn><eissn>1433-3058</eissn><abstract>This paper proposes a novel effective optimization algorithm called enhanced coyote optimization algorithm (ECOA). This proposed method is applied to optimally select the position and capacity of distributed generators (DGs) in radial distribution networks. It is a multi-objective optimization problem where properly installing DGs should simultaneously reduce the power loss, operating costs as well as improve voltage stability. Based on the original coyote optimization algorithm (COA), ECOA is developed to be able to expand the search area and retain a good solution group in each generation. It includes two modifications to improve the efficiency of the original COA approach where the first one is replacing the central solution by the best current solution in the first new solution generation technique and the second focuses on reducing the computation burden and process time in the second new solution generation step. In this research, various experiments have been implemented by applying ECOA, COA as well as salp swarm algorithm (SSA), Sunflower optimization (SOA) for three IEEE radial distribution power networks with 33, 69 and 85 buses. Obtained results have been statistically analyzed to investigate the appropriate control parameters and to verify the performance of the proposed ECOA method. In addition, the performance of ECOA is also compared to various similar meta-heuristic methods such as genetic algorithm (GA), particle swarm optimization (PSO), hybrid genetic algorithm and particle swarm optimization (HGA-PSO), simulated annealing, bacterial foraging optimization algorithm, backtracking search optimization algorithm, harmony search algorithm, whale optimization algorithm (WOA) and combined power loss index-whale optimization algorithm (PLI-WOA). Detailed comparisons show that ECOA can determine more effective location and size of DGs with faster speed than other methods. Specifically, the improvement levels of the proposed method over compared to SFO, SSA, and COA can be up to 2.1978%, 0.7858% and 0.2348%. Furthermore, as compared to other existing methods in references, ECOA achieves the significant improvements which are up to 31.7491%, 20.2143% and 22.7213% for the three test systems, respectively. Thus, the proposed method is a favorable method in solving the optimal determination of DGs in radial distribution networks.</abstract><cop>London</cop><pub>Springer London</pub><doi>10.1007/s00521-020-05239-1</doi><tpages>29</tpages><orcidid>https://orcid.org/0000-0002-0951-410X</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0941-0643 |
ispartof | Neural computing & applications, 2021-05, Vol.33 (9), p.4343-4371 |
issn | 0941-0643 1433-3058 |
language | eng |
recordid | cdi_proquest_journals_2516609780 |
source | SpringerNature Journals |
subjects | Artificial Intelligence Computational Biology/Bioinformatics Computational Science and Engineering Computer Science Data Mining and Knowledge Discovery Distributed generation Electric power distribution Genetic algorithms Heuristic methods Image Processing and Computer Vision Multiple objective analysis Networks Optimization algorithms Original Article Particle swarm optimization Probability and Statistics in Computer Science Radial distribution Search algorithms Simulated annealing Sunflowers Voltage stability |
title | Find optimal capacity and location of distributed generation units in radial distribution networks by using enhanced coyote optimization algorithm |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T14%3A51%3A12IST&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=Find%20optimal%20capacity%20and%20location%20of%20distributed%20generation%20units%20in%20radial%20distribution%20networks%20by%20using%20enhanced%20coyote%20optimization%20algorithm&rft.jtitle=Neural%20computing%20&%20applications&rft.au=Pham,%20Thai%20Dinh&rft.date=2021-05-01&rft.volume=33&rft.issue=9&rft.spage=4343&rft.epage=4371&rft.pages=4343-4371&rft.issn=0941-0643&rft.eissn=1433-3058&rft_id=info:doi/10.1007/s00521-020-05239-1&rft_dat=%3Cproquest_cross%3E2516609780%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2516609780&rft_id=info:pmid/&rfr_iscdi=true |