Title | A Multi-objective Optimization Algorithm for Bus Type Assignments in Random Topology Power Grid Model |
Publication Type | Conference Paper |
Year of Publication | 2016 |
Authors | Seyyed Hamid Elyas, Zhifang Wang |
Conference Name | 2016 49th Hawaii International Conference on System Sciences (HICSS) |
Date Published | 01/2016 |
Publisher | IEEE |
Conference Location | Koloa, HI, USA |
Keywords | RM14-003 |
Abstract | Our previous work proposed a random topology power grid model, called RT-nested-smallworld, formulated based on a comprehensive study of the real-world grid topologies and electrical properties. The model can be used to produce a sufficiently large number of power grid test cases with scalable network size and featuring the same kind of small-world topology and electrical characteristics found in realistic grids. However, the proposed RT-power grid model has a shortcoming that is its random assignment of bus types (i.e. Generation, Load, or Connection), which is inconsistent with that of a realistic grid. Because our recent study found that the bus type assignment in a realistic power grid is not random but a correlated one. With the help of Bus Type Entropy, a novel measure which provides a quantitative means to better represent the correlation of bus type assignments in a grid topology, we propose a multi-objective optimization algorithm for the bus type assignments in the random topology power grid modeling. The proposed search algorithm is able to locate the best set of bus type assignments for a given random "electrical" topology generated by RT-nested-smallworld, so that each bus type assignment in the target set will have a Bus Type Entropy value close to that of a realistic grid with comparable network size. In order to demonstrate the performance of the proposed multi-objective algorithm, we experiment our algorithm on three sets of realistic power systems, namely, the IEEE-300 bus system, the NYISO system and the MPC system. The obtained results confirm the validity of our proposed method. |
DOI | 10.1109/HICSS.2016.306 |