本論文以本島電網為例，使用PSS/E工具軟體進行模擬本島尖峰時的電力潮流及暫態穩定度，再利用光譜二分演算法，先初步將系統二分細切分割至預先設定的匯流排數量，在進行最底層小區域的孤島模擬，研究方法有發電量和負載平衡與否、線路是否過載、電壓暫態穩定度、電壓大小範圍分佈來判斷其虛功率補償是否充足，假如小區域不穩定再將其鄰近區域合併，直到模擬產生出可以孤島運轉的區域為止，本島全部可供孤島運行區域找到後，再找出各孤島間的分離邊界線路，來研究判斷是否某些邊界線路跳脫後，會出現不穩定的情況，假如不進行孤島運轉，會使系統發生更嚴重的事故，這些情況就是可以觸發孤島的條件，最後提出建議措施。

The peak power flow and transient stability for Taiwan power grid would be simulate in this thesis by using the power system simulation for engineers (PSS/E). First, the system would be partitioned into some groups whose bus number would be set under some buses in advance by using spectral bisection. Second, every group was simulated to confirm whether this group can be islanding operation. There are some research methods to evaluate whether islanding operation can work by itself such as the balance between generations and loads, line overload, transient voltage stability and the range of voltage distribution to determine whether its reactive power compensation is adequate. If the small group was unstable, the neighbor group would be merged together. The neighbor groups would be continued to merge until islanding operation can work well by itself. After all available islanding areas were found, the boundary among the islands would be searched to simulate whether tripping some of the boundary lines would make system unstable. If the system cannot operate in islanding situation at this time, the system will touch off more serious power outage. Islanding operation can be triggered in these conditions. Finally, some suggestion methods will be proposed.

[1]台灣電力公司電力調度處網頁，「http://w3.taipower.com.tw」，2010.

[2]George Karypis and Vipin Kumar, “A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs”, SIAM Journal on Scientific Computing,1998.

[3]Youssef G. Saab, ” An effective multilevel algorithm for bisecting graphs and hypergraphs ,” IEEE Transactions on computers , vol.53
, pp 641 – 652, 2004.

[4]Juan Li and Chen-Ching Liu,” Power system reconfiguration based on multilevel graph partitioning,” PowerTech, IEEE Bucharest, pp 1-5
, 2009.

[5]Abou-Rjeili, A. and Karypis, G.,” Multilevel algorithms for partitioning power-law graphs,” Parallel and Distributed Processing Symposium, IEEE Conferences, 2006.

[6]Dhillon, I.S., Yuqiang Guan, and Kulis, B.,”Weighted Graph Cuts without Eigenvectors A Multilevel Approach,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol.29, pp 1944 - 1957, 2007.

[7]P. K. Chan, M. Schlag, and J. Zien.,” Spectral K-way ratio-cut
partitioning and clustering[J],” IEEE Trans. Computer-Aided Design
integr. Circuits Syst., 13(9):1088-1096, 1994.

[8]Wu Linfeng , Wu Junyong , Yang Yuan, and Wang Yongzhe, “A Novel Dynamic Partitioning and Active-Splitting Strategy in Power System Emergency Control,” Power and Energy Engineering Conference (APPEEC), Asia-Pacific, pp1-6, 2010.

[9]Wang, C. G., Zhang, B. H., Hao, Z. G., Shu, J. , and Li, P.; Bo, Z. Q.
” A Novel Real-Time Searching Method for Power System Splitting Boundary,” IEEE Transactions on Power Systems, 2010

[10]https://www.pti-us.com/pti/software/psse/user_support.cfm，PSS/E官方網站

[11]Bojan Mohar,” The Laplacian Spectrum Of Graphs”,1991

[12]Alex Pothen , Horst D. Simon , and Kang-Pu Liou,” Partitioning sparse matrices with eigenvectors of graphs,” SIAM Journal of Matrix Analysis and Applications, 11(3):430–452, 1990.

[13]PSS/E-31.0 Users Manual, Siemens, December 2007

[14]http://zh.wikipedia.org/zh-tw/Python，維基網站

[15]http://numpy.scipy.org/，Numpy官方網站

[16]B.W. Kernighan ; S. Lin,” An efficient heuristic procedure for partitioning graphs”, The Bell System Technical Journal,1970.

[17]http://en.wikipedia.org/wiki/Laplacian_matrix ，維基網站

[18]http://en.wikipedia.org/wiki/Spanning_tree_(mathematics)，維基網站

[19]http://wiki.python.org/moin/GuiProgramming，Python官方網站

[20]http://www.riverbankcomputing.co.uk/software/pyqt/download，PyQt4官方網站

[21]http://eric-ide.python-projects.org/，Eric4 Python IDE官方網站

[22]臺灣電力股份有限公司輸電系統規劃準則，民國97年6月