Using Genetic Algorithm on Optimal Active-Reactive Power Scheduling with Considering Wind Generation Uncertainties
碩士 === 國立臺北科技大學 === 電機工程系研究所 === 102 === Recently, the importance of power supply from clean recycle energy has drawn great attention because of environmental protection and increasing cost of international energy, especially the technique of wind power generator because of its potential in research...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/s96a52 |
id |
ndltd-TW-102TIT05442025 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-102TIT054420252019-05-15T21:42:06Z http://ndltd.ncl.edu.tw/handle/s96a52 Using Genetic Algorithm on Optimal Active-Reactive Power Scheduling with Considering Wind Generation Uncertainties 應用基因演算法於考慮風力發電不確定之實功率-虛功率排程最佳化 Hsin-Tsung Kao 高薪淙 碩士 國立臺北科技大學 電機工程系研究所 102 Recently, the importance of power supply from clean recycle energy has drawn great attention because of environmental protection and increasing cost of international energy, especially the technique of wind power generator because of its potential in research. In this thesis, genetic algorithm is applied to power system in optimal management for 24 hours active-reactive power. Among the past research, active power and reactive power were usually analyzed separately and single operation point was only considered in those cases. Here, both active power and reactive power are combined to schedule. Additionally, time of 24 hours and uncertainty of wind power generation into consideration, genetic algorithm is introduced to meet the satisfaction of minimized fuel cost and transmission line losses rate in all limited operation systems. Due to those uncertain factors considered in this research, ten different twenty four hour-wind power data is used to simulation of wind power for various situations in wind power generation. Therefore, the optimal schedule can be found in those uncertain factors of wind power generation and fit to all restrictions. In this study, genetic algorithm is adopted to find the optimized parameters while the goal function is a multiple objective function through the weighted value synthesis of the minimize transmission line loss rate for reactive power scheduling and the minimized fuel cost in active power scheduling. By analyzing IEEE 30-BUS, prove the method is feasible in active-reactive power scheduling. Obtain reduce cost and transmission line loss. Also power system operating voltage are within a reasonable rang. Above all, those are expected to provide much more economical and safer operation as reference for the dispatchers in the future. Chao-Rong Chen 陳昭榮 2014 學位論文 ; thesis 71 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺北科技大學 === 電機工程系研究所 === 102 === Recently, the importance of power supply from clean recycle energy has drawn great attention because of environmental protection and increasing cost of international energy, especially the technique of wind power generator because of its potential in research. In this thesis, genetic algorithm is applied to power system in optimal management for 24 hours active-reactive power. Among the past research, active power and reactive power were usually analyzed separately and single operation point was only considered in those cases. Here, both active power and reactive power are combined to schedule. Additionally, time of 24 hours and uncertainty of wind power generation into consideration, genetic algorithm is introduced to meet the satisfaction of minimized fuel cost and transmission line losses rate in all limited operation systems. Due to those uncertain factors considered in this research, ten different twenty four hour-wind power data is used to simulation of wind power for various situations in wind power generation. Therefore, the optimal schedule can be found in those uncertain factors of wind power generation and fit to all restrictions.
In this study, genetic algorithm is adopted to find the optimized parameters while the goal function is a multiple objective function through the weighted value synthesis of the minimize transmission line loss rate for reactive power scheduling and the minimized fuel cost in active power scheduling. By analyzing IEEE 30-BUS, prove the method is feasible in active-reactive power scheduling. Obtain reduce cost and transmission line loss. Also power system operating voltage are within a reasonable rang. Above all, those are expected to provide much more economical and safer operation as reference for the dispatchers in the future.
|
author2 |
Chao-Rong Chen |
author_facet |
Chao-Rong Chen Hsin-Tsung Kao 高薪淙 |
author |
Hsin-Tsung Kao 高薪淙 |
spellingShingle |
Hsin-Tsung Kao 高薪淙 Using Genetic Algorithm on Optimal Active-Reactive Power Scheduling with Considering Wind Generation Uncertainties |
author_sort |
Hsin-Tsung Kao |
title |
Using Genetic Algorithm on Optimal Active-Reactive Power Scheduling with Considering Wind Generation Uncertainties |
title_short |
Using Genetic Algorithm on Optimal Active-Reactive Power Scheduling with Considering Wind Generation Uncertainties |
title_full |
Using Genetic Algorithm on Optimal Active-Reactive Power Scheduling with Considering Wind Generation Uncertainties |
title_fullStr |
Using Genetic Algorithm on Optimal Active-Reactive Power Scheduling with Considering Wind Generation Uncertainties |
title_full_unstemmed |
Using Genetic Algorithm on Optimal Active-Reactive Power Scheduling with Considering Wind Generation Uncertainties |
title_sort |
using genetic algorithm on optimal active-reactive power scheduling with considering wind generation uncertainties |
publishDate |
2014 |
url |
http://ndltd.ncl.edu.tw/handle/s96a52 |
work_keys_str_mv |
AT hsintsungkao usinggeneticalgorithmonoptimalactivereactivepowerschedulingwithconsideringwindgenerationuncertainties AT gāoxīncóng usinggeneticalgorithmonoptimalactivereactivepowerschedulingwithconsideringwindgenerationuncertainties AT hsintsungkao yīngyòngjīyīnyǎnsuànfǎyúkǎolǜfēnglìfādiànbùquèdìngzhīshígōnglǜxūgōnglǜpáichéngzuìjiāhuà AT gāoxīncóng yīngyòngjīyīnyǎnsuànfǎyúkǎolǜfēnglìfādiànbùquèdìngzhīshígōnglǜxūgōnglǜpáichéngzuìjiāhuà |
_version_ |
1719117886598938624 |