OPTIMAL REPAIR SEQUENCE OF FAULTS FOR DISTRIBUTION SYSTEM AFTER A TYPHOON
碩士 === 大同大學 === 電機工程學系(所) === 102 === Typhoons often cause significant damages to the distribution system, and result in a lot of customer blackouts. Due to the limited human resources of power company, it is necessary to figure out the optimal repair sequence for multi-fault distribution system to...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/67brdt |
id |
ndltd-TW-102TTU05442016 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-102TTU054420162019-05-15T21:32:55Z http://ndltd.ncl.edu.tw/handle/67brdt OPTIMAL REPAIR SEQUENCE OF FAULTS FOR DISTRIBUTION SYSTEM AFTER A TYPHOON 颱風過後配電系統故障的最佳維修順序 Hsing-Chiang Wang 王幸強 碩士 大同大學 電機工程學系(所) 102 Typhoons often cause significant damages to the distribution system, and result in a lot of customer blackouts. Due to the limited human resources of power company, it is necessary to figure out the optimal repair sequence for multi-fault distribution system to restore the power for customers as soon as possible. This paper uses three mathematical variables, (1) the repair time of a failure, (2) the travel time between two nodes, and (3) the number of customer to be restored after a fault is cleared, to formulate the objective function. The optimal repair sequence will be determined as the minimum total customer interruption hours. The C++ is used as the programming language to perform calculations. There are four cases will be simulated to justify the proposed method is useful for a radial distribution system with multiple faults. It will also demonstrate the effectiveness of these three variables to the optimal results. Wen-chen Chu 朱文成 2014 學位論文 ; thesis 86 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 大同大學 === 電機工程學系(所) === 102 === Typhoons often cause significant damages to the distribution system, and result in a lot of customer blackouts. Due to the limited human resources of power company, it is necessary to figure out the optimal repair sequence for multi-fault distribution system to restore the power for customers as soon as possible.
This paper uses three mathematical variables, (1) the repair time of a failure, (2) the travel time between two nodes, and (3) the number of customer to be restored after a fault is cleared, to formulate the objective function. The optimal repair sequence will be determined as the minimum total customer interruption hours. The C++ is used as the programming language to perform calculations.
There are four cases will be simulated to justify the proposed method is useful for a radial distribution system with multiple faults. It will also demonstrate the effectiveness of these three variables to the optimal results.
|
author2 |
Wen-chen Chu |
author_facet |
Wen-chen Chu Hsing-Chiang Wang 王幸強 |
author |
Hsing-Chiang Wang 王幸強 |
spellingShingle |
Hsing-Chiang Wang 王幸強 OPTIMAL REPAIR SEQUENCE OF FAULTS FOR DISTRIBUTION SYSTEM AFTER A TYPHOON |
author_sort |
Hsing-Chiang Wang |
title |
OPTIMAL REPAIR SEQUENCE OF FAULTS FOR DISTRIBUTION SYSTEM AFTER A TYPHOON |
title_short |
OPTIMAL REPAIR SEQUENCE OF FAULTS FOR DISTRIBUTION SYSTEM AFTER A TYPHOON |
title_full |
OPTIMAL REPAIR SEQUENCE OF FAULTS FOR DISTRIBUTION SYSTEM AFTER A TYPHOON |
title_fullStr |
OPTIMAL REPAIR SEQUENCE OF FAULTS FOR DISTRIBUTION SYSTEM AFTER A TYPHOON |
title_full_unstemmed |
OPTIMAL REPAIR SEQUENCE OF FAULTS FOR DISTRIBUTION SYSTEM AFTER A TYPHOON |
title_sort |
optimal repair sequence of faults for distribution system after a typhoon |
publishDate |
2014 |
url |
http://ndltd.ncl.edu.tw/handle/67brdt |
work_keys_str_mv |
AT hsingchiangwang optimalrepairsequenceoffaultsfordistributionsystemafteratyphoon AT wángxìngqiáng optimalrepairsequenceoffaultsfordistributionsystemafteratyphoon AT hsingchiangwang táifēngguòhòupèidiànxìtǒnggùzhàngdezuìjiāwéixiūshùnxù AT wángxìngqiáng táifēngguòhòupèidiànxìtǒnggùzhàngdezuìjiāwéixiūshùnxù |
_version_ |
1719117356208226304 |