區塊切割法在電力調度計劃之應用

The Application of the Block Cutting Method on Power Dispatch Plan

曾奕叡(Yi-Ruei Zeng)

指導教授 ： 黃怡詔

國立屏東科技大學/管理學院/工業管理系所/碩士(2010年)

https://doi.org/10.6346/NPUST.2010.00065

摘要

台電公司調度處負責停電審修作業，若採取區域性時間集中的停電計畫，將可降低停電期間對用戶所造成的困擾，台電公司不同維修單位在不同的時間提出停電計畫，以目前人工審視方式無法有效率的判斷不同日期區域接近的停電排程，故本研究提出區塊切割法將複雜的圖形簡化，以便於在較短的時間內計算出電廠與變電所間的最短層級距離，最後列出所有停電維修計畫區段的關連性，讓台電停電審修人員即刻瞭解停電計畫區域的階層關係，不僅可以迅速擬出停電計畫並提升整體維修效率，也可降低用戶在停電時的損失，在台電顧客關係管理上也能維持良好的合作關係。

關鍵字

區塊切割法 ； 台電公司 ； Dijkstra 演算法 ； 電力調度計畫

並列摘要

The department of system operation of Taiwan Power Company is responsible for scheduling the power outage repair work, if adopting the plan of the regional time-centralized power outage, the besetment that brought to the users during the power outage period will be lessened. Furthers, different repair units in Taiwan Power Company propose the power outage plan in different time. However, at present, the examination work done by the manpower is not efficient at all to help judging the power outage schedule that in adjacent regions but in different dates for power outage schedule. Therefore, in this paper, the representation way of the graphical spots is used to stand for the locations of each power plant and each substation. And by the use of Block Cutting Method to calculate the shortest stratum’s distance between graphical spots, and then finally find out the relations of all the sections of power outage repair plan, thus the Taiwan Power Company’s examine and repair staff can immediately understand the regional stratum relations of the power outage plan, hence to quickly draw up the power outage plan in order to promote the efficiency of the entire repair work.

並列關鍵字

Block Cutting Method ； Taiwan Power Company ； Dijkstra Algorithm ； Power Dispatch Plan

參考文獻

2. 許志榮，「二分排列圖限制在最大分支度為4的電力支配問題」，碩士論文，國立暨南國際大學 (2008)

5. 黃勇嘉， 黃三益，「 行動網路專線電路之調訂路由選擇」， 資訊管理學報，第十六卷，第一期， 第53-77頁(2009)

4. 張傑、黃有評、蔡佳勝，「以改良的A*演算法規劃較佳導引路徑之研究」，碩士論文，大同大學 (2009)

9. Athanasios K. Ziliaskopoulos, Fotios D. Mandanas, Hani S. Mahmassani, “An extension of labeling techniques for finding shortest path trees,” European Journal of Operational Research, 198, 63–72 (2009)

10. Byung-In Kim, Sangwon Jeong, “A comparison of algorithms for origin–destination matrix generation on real road networks and an approximation approach,” Computers & Industrial Engineering, 56, 70–76 (2009)