Loading…

Optimization of short-term hydropower scheduling with dynamic reservoir capacity based on improved genetic algorithm and parallel computing

•Modified dynamic reservoir capacity model used for short-term optimal scheduling.•Combination of genetic algorithm and parallel computing improves calculation speed.•Improved genetic algorithm effectively enhanced model convergence.•The model with parallel computing achieves 246 × speedup over the...

Full description

Saved in:
Bibliographic Details
Published in:Journal of hydrology (Amsterdam) 2024-06, Vol.636, p.131238, Article 131238
Main Authors: Zhang, Rongqi, Zhang, Shanghong, Wen, Xiaoxiong, Yue, Ziqi, Zhou, Yang
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-c309t-ff6c508208faa416d9910aa687ef3dfc9ce864a5915f1718d6295e54a4b1156a3
cites cdi_FETCH-LOGICAL-c309t-ff6c508208faa416d9910aa687ef3dfc9ce864a5915f1718d6295e54a4b1156a3
container_end_page
container_issue
container_start_page 131238
container_title Journal of hydrology (Amsterdam)
container_volume 636
creator Zhang, Rongqi
Zhang, Shanghong
Wen, Xiaoxiong
Yue, Ziqi
Zhou, Yang
description •Modified dynamic reservoir capacity model used for short-term optimal scheduling.•Combination of genetic algorithm and parallel computing improves calculation speed.•Improved genetic algorithm effectively enhanced model convergence.•The model with parallel computing achieves 246 × speedup over the enumeration method. The optimal scheduling of hydropower plants is important for the efficient operation and management of hydropower energy systems. In the short-term optimization scheduling of river-type reservoirs, the dynamic reservoir capacity is a key factor. Currently, the short-term power generation scheduling model considering dynamic reservoir capacity was solved by the enumeration method, providing a more accurate simulation of the water flow process compared to the model considering static reservoir capacity. However, the solving process had the disadvantage of a large computational burden and excessive time consumption, which restricted application in the actual scheduling of reservoirs. Therefore, to solve the time-consuming problem of repeated calculation of hydrodynamics model in optimization scheduling, an improved genetic algorithm including adaptive and elitist-selection strategies combined with the parallel computing technique was proposed. The optimal scheduling plan generated by this model were compared with the optimization results of the enumeration method and the genetic algorithm scheduling model. The results showed that the optimal power generation selected by the three models were extremely similar and the optimization model could find the optimal value for the scheduling period. In terms of computing speed, the improved genetic algorithm parallel technique took approximately 0.8 h, around 246 times faster than the enumeration method and 20 times faster than the model without using parallel computing. It demonstrates that the present algorithm is practically usable, significantly enhancing the optimization efficiency of scheduling solutions. Furthermore, it satisfies the engineering application efficiency requirements and can provide technical support for the subsequent power generation scheduling of the Three Gorges Reservoir.
doi_str_mv 10.1016/j.jhydrol.2024.131238
format article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_jhydrol_2024_131238</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0022169424006334</els_id><sourcerecordid>S0022169424006334</sourcerecordid><originalsourceid>FETCH-LOGICAL-c309t-ff6c508208faa416d9910aa687ef3dfc9ce864a5915f1718d6295e54a4b1156a3</originalsourceid><addsrcrecordid>eNqFkMtOwzAQRS0EEqXwCUj-gQQ776wQqnhJlbqBtTW1x42jJI5st1X4BX6alLJnNjOLe49Gh5B7zmLOePHQxm0zKWe7OGFJFvOUJ2l1QRa8KusoKVl5SRaMJUnEizq7Jjfet2yeNM0W5HszBtObLwjGDtRq6hvrQhTQ9fQXOtojOuplg2rfmWFHjyY0VE0D9EZShx7dwRpHJYwgTZjoFjwqOsNMPzp7mO8dDhjmMHQ76-Z2T2FQdAQHXYcdlbYf92FG35IrDZ3Hu7-9JJ8vzx-rt2i9eX1fPa0jmbI6RFoXMmdVwioNkPFC1TVnAEVVok6VlrXEqsggr3mueckrVSR1jnkG2ZbzvIB0SfIzVzrrvUMtRmd6cJPgTJyMilb8GRUno-JsdO49nns4P3cw6ISXBgeJyjiUQShr_iH8APtShrQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Optimization of short-term hydropower scheduling with dynamic reservoir capacity based on improved genetic algorithm and parallel computing</title><source>Elsevier</source><creator>Zhang, Rongqi ; Zhang, Shanghong ; Wen, Xiaoxiong ; Yue, Ziqi ; Zhou, Yang</creator><creatorcontrib>Zhang, Rongqi ; Zhang, Shanghong ; Wen, Xiaoxiong ; Yue, Ziqi ; Zhou, Yang</creatorcontrib><description>•Modified dynamic reservoir capacity model used for short-term optimal scheduling.•Combination of genetic algorithm and parallel computing improves calculation speed.•Improved genetic algorithm effectively enhanced model convergence.•The model with parallel computing achieves 246 × speedup over the enumeration method. The optimal scheduling of hydropower plants is important for the efficient operation and management of hydropower energy systems. In the short-term optimization scheduling of river-type reservoirs, the dynamic reservoir capacity is a key factor. Currently, the short-term power generation scheduling model considering dynamic reservoir capacity was solved by the enumeration method, providing a more accurate simulation of the water flow process compared to the model considering static reservoir capacity. However, the solving process had the disadvantage of a large computational burden and excessive time consumption, which restricted application in the actual scheduling of reservoirs. Therefore, to solve the time-consuming problem of repeated calculation of hydrodynamics model in optimization scheduling, an improved genetic algorithm including adaptive and elitist-selection strategies combined with the parallel computing technique was proposed. The optimal scheduling plan generated by this model were compared with the optimization results of the enumeration method and the genetic algorithm scheduling model. The results showed that the optimal power generation selected by the three models were extremely similar and the optimization model could find the optimal value for the scheduling period. In terms of computing speed, the improved genetic algorithm parallel technique took approximately 0.8 h, around 246 times faster than the enumeration method and 20 times faster than the model without using parallel computing. It demonstrates that the present algorithm is practically usable, significantly enhancing the optimization efficiency of scheduling solutions. Furthermore, it satisfies the engineering application efficiency requirements and can provide technical support for the subsequent power generation scheduling of the Three Gorges Reservoir.</description><identifier>ISSN: 0022-1694</identifier><identifier>EISSN: 1879-2707</identifier><identifier>DOI: 10.1016/j.jhydrol.2024.131238</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Genetic Algorithm ; OpenMP ; Parallel Computing ; Reservoir Optimization Scheduling ; Three Gorges Reservoir</subject><ispartof>Journal of hydrology (Amsterdam), 2024-06, Vol.636, p.131238, Article 131238</ispartof><rights>2024 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c309t-ff6c508208faa416d9910aa687ef3dfc9ce864a5915f1718d6295e54a4b1156a3</citedby><cites>FETCH-LOGICAL-c309t-ff6c508208faa416d9910aa687ef3dfc9ce864a5915f1718d6295e54a4b1156a3</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>Zhang, Rongqi</creatorcontrib><creatorcontrib>Zhang, Shanghong</creatorcontrib><creatorcontrib>Wen, Xiaoxiong</creatorcontrib><creatorcontrib>Yue, Ziqi</creatorcontrib><creatorcontrib>Zhou, Yang</creatorcontrib><title>Optimization of short-term hydropower scheduling with dynamic reservoir capacity based on improved genetic algorithm and parallel computing</title><title>Journal of hydrology (Amsterdam)</title><description>•Modified dynamic reservoir capacity model used for short-term optimal scheduling.•Combination of genetic algorithm and parallel computing improves calculation speed.•Improved genetic algorithm effectively enhanced model convergence.•The model with parallel computing achieves 246 × speedup over the enumeration method. The optimal scheduling of hydropower plants is important for the efficient operation and management of hydropower energy systems. In the short-term optimization scheduling of river-type reservoirs, the dynamic reservoir capacity is a key factor. Currently, the short-term power generation scheduling model considering dynamic reservoir capacity was solved by the enumeration method, providing a more accurate simulation of the water flow process compared to the model considering static reservoir capacity. However, the solving process had the disadvantage of a large computational burden and excessive time consumption, which restricted application in the actual scheduling of reservoirs. Therefore, to solve the time-consuming problem of repeated calculation of hydrodynamics model in optimization scheduling, an improved genetic algorithm including adaptive and elitist-selection strategies combined with the parallel computing technique was proposed. The optimal scheduling plan generated by this model were compared with the optimization results of the enumeration method and the genetic algorithm scheduling model. The results showed that the optimal power generation selected by the three models were extremely similar and the optimization model could find the optimal value for the scheduling period. In terms of computing speed, the improved genetic algorithm parallel technique took approximately 0.8 h, around 246 times faster than the enumeration method and 20 times faster than the model without using parallel computing. It demonstrates that the present algorithm is practically usable, significantly enhancing the optimization efficiency of scheduling solutions. Furthermore, it satisfies the engineering application efficiency requirements and can provide technical support for the subsequent power generation scheduling of the Three Gorges Reservoir.</description><subject>Genetic Algorithm</subject><subject>OpenMP</subject><subject>Parallel Computing</subject><subject>Reservoir Optimization Scheduling</subject><subject>Three Gorges Reservoir</subject><issn>0022-1694</issn><issn>1879-2707</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNqFkMtOwzAQRS0EEqXwCUj-gQQ776wQqnhJlbqBtTW1x42jJI5st1X4BX6alLJnNjOLe49Gh5B7zmLOePHQxm0zKWe7OGFJFvOUJ2l1QRa8KusoKVl5SRaMJUnEizq7Jjfet2yeNM0W5HszBtObLwjGDtRq6hvrQhTQ9fQXOtojOuplg2rfmWFHjyY0VE0D9EZShx7dwRpHJYwgTZjoFjwqOsNMPzp7mO8dDhjmMHQ76-Z2T2FQdAQHXYcdlbYf92FG35IrDZ3Hu7-9JJ8vzx-rt2i9eX1fPa0jmbI6RFoXMmdVwioNkPFC1TVnAEVVok6VlrXEqsggr3mueckrVSR1jnkG2ZbzvIB0SfIzVzrrvUMtRmd6cJPgTJyMilb8GRUno-JsdO49nns4P3cw6ISXBgeJyjiUQShr_iH8APtShrQ</recordid><startdate>202406</startdate><enddate>202406</enddate><creator>Zhang, Rongqi</creator><creator>Zhang, Shanghong</creator><creator>Wen, Xiaoxiong</creator><creator>Yue, Ziqi</creator><creator>Zhou, Yang</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>202406</creationdate><title>Optimization of short-term hydropower scheduling with dynamic reservoir capacity based on improved genetic algorithm and parallel computing</title><author>Zhang, Rongqi ; Zhang, Shanghong ; Wen, Xiaoxiong ; Yue, Ziqi ; Zhou, Yang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c309t-ff6c508208faa416d9910aa687ef3dfc9ce864a5915f1718d6295e54a4b1156a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Genetic Algorithm</topic><topic>OpenMP</topic><topic>Parallel Computing</topic><topic>Reservoir Optimization Scheduling</topic><topic>Three Gorges Reservoir</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Rongqi</creatorcontrib><creatorcontrib>Zhang, Shanghong</creatorcontrib><creatorcontrib>Wen, Xiaoxiong</creatorcontrib><creatorcontrib>Yue, Ziqi</creatorcontrib><creatorcontrib>Zhou, Yang</creatorcontrib><collection>CrossRef</collection><jtitle>Journal of hydrology (Amsterdam)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhang, Rongqi</au><au>Zhang, Shanghong</au><au>Wen, Xiaoxiong</au><au>Yue, Ziqi</au><au>Zhou, Yang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimization of short-term hydropower scheduling with dynamic reservoir capacity based on improved genetic algorithm and parallel computing</atitle><jtitle>Journal of hydrology (Amsterdam)</jtitle><date>2024-06</date><risdate>2024</risdate><volume>636</volume><spage>131238</spage><pages>131238-</pages><artnum>131238</artnum><issn>0022-1694</issn><eissn>1879-2707</eissn><abstract>•Modified dynamic reservoir capacity model used for short-term optimal scheduling.•Combination of genetic algorithm and parallel computing improves calculation speed.•Improved genetic algorithm effectively enhanced model convergence.•The model with parallel computing achieves 246 × speedup over the enumeration method. The optimal scheduling of hydropower plants is important for the efficient operation and management of hydropower energy systems. In the short-term optimization scheduling of river-type reservoirs, the dynamic reservoir capacity is a key factor. Currently, the short-term power generation scheduling model considering dynamic reservoir capacity was solved by the enumeration method, providing a more accurate simulation of the water flow process compared to the model considering static reservoir capacity. However, the solving process had the disadvantage of a large computational burden and excessive time consumption, which restricted application in the actual scheduling of reservoirs. Therefore, to solve the time-consuming problem of repeated calculation of hydrodynamics model in optimization scheduling, an improved genetic algorithm including adaptive and elitist-selection strategies combined with the parallel computing technique was proposed. The optimal scheduling plan generated by this model were compared with the optimization results of the enumeration method and the genetic algorithm scheduling model. The results showed that the optimal power generation selected by the three models were extremely similar and the optimization model could find the optimal value for the scheduling period. In terms of computing speed, the improved genetic algorithm parallel technique took approximately 0.8 h, around 246 times faster than the enumeration method and 20 times faster than the model without using parallel computing. It demonstrates that the present algorithm is practically usable, significantly enhancing the optimization efficiency of scheduling solutions. Furthermore, it satisfies the engineering application efficiency requirements and can provide technical support for the subsequent power generation scheduling of the Three Gorges Reservoir.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.jhydrol.2024.131238</doi></addata></record>
fulltext fulltext
identifier ISSN: 0022-1694
ispartof Journal of hydrology (Amsterdam), 2024-06, Vol.636, p.131238, Article 131238
issn 0022-1694
1879-2707
language eng
recordid cdi_crossref_primary_10_1016_j_jhydrol_2024_131238
source Elsevier
subjects Genetic Algorithm
OpenMP
Parallel Computing
Reservoir Optimization Scheduling
Three Gorges Reservoir
title Optimization of short-term hydropower scheduling with dynamic reservoir capacity based on improved genetic algorithm and parallel computing
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T11%3A40%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimization%20of%20short-term%20hydropower%20scheduling%20with%20dynamic%20reservoir%20capacity%20based%20on%20improved%20genetic%20algorithm%20and%20parallel%20computing&rft.jtitle=Journal%20of%20hydrology%20(Amsterdam)&rft.au=Zhang,%20Rongqi&rft.date=2024-06&rft.volume=636&rft.spage=131238&rft.pages=131238-&rft.artnum=131238&rft.issn=0022-1694&rft.eissn=1879-2707&rft_id=info:doi/10.1016/j.jhydrol.2024.131238&rft_dat=%3Celsevier_cross%3ES0022169424006334%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c309t-ff6c508208faa416d9910aa687ef3dfc9ce864a5915f1718d6295e54a4b1156a3%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