2023-02-04T19:05:35Z
https://kitami-it.repo.nii.ac.jp/oai
oai:kitami-it.repo.nii.ac.jp:00006497
2022-12-13T02:19:51Z
7:15:33
Determination of the Load Restoration Sequence Taking into Consideration of the Cost of Power Interruptions ?An investigation of Computing Time of Branch and Bound Method’s Solution -
停電損失を考慮した事故時負荷復旧順序の決定手法* -分枝限定解法の演算時間の検討-
奈良, 宏一
32829
山城, 迪
32830
application/pdf
When power interruptions happen through fault in a power system, the load should be restored by a sequence which minimizes the cost of power interruptions. Although this problem can be formulated as a linear programing problem based on certain assumptions, it must be formulated as a nonlinear programing problem, if some of these assumptions cannot be held. In latter case, the problem can be effectively solved by the branch and hound method, but, generally, the computing time exceeds the range of practical use. This is a result of the large number of variables. In this problem, it is discovered that the computing time is more than 10 minutes using HITAC/M-180, as the number of variables increases to more than 400. This difficulty can be overcome by introducing a new concept : block priority. Block priority maintains the priority order of one load and the others, as well as minimizing the cost of power interruptions. It allocates simultaneously, the variables of the problem to different levels of priority, giving less than 400 variables to any one priority level, this can reduce the computing time significantly. Nevertheless, it is considered that more work is necessary to develop different effective methods which can further decrease the computing time.
departmental bulletin paper
北見工業大学
1981-01
application/pdf
北見工業大学研究報告
1
12
35
48
https://kitami-it.repo.nii.ac.jp/record/6497/files/12-1-4.pdf
jpn