{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/50397"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/50397","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Generating random power grids for the verification of new load flow solvers","abstract":"The purpose of this thesis is to expand the rigor of the development of new power flow solvers through graph generation. The use of the IEEE standard test cases as benchmarks is commonplace in literature, where they are used to demonstrate the effectiveness of new algorithms. This results in the use of as little as two to five grids with only tens or hundreds of nodes each. The sample size for these tests is very small and cannot fully represent the behavior of the algorithms being tested. Since this problem stems from the lack of real, publicly available grids, a solution is to generate power grids with the necessary components. This thesis is the first to compare the performance of numerical methods in this setting. Two popular numerical methods are considered: the Newton-Raphson (NR) and Fast Decoupled Load Flow (FDLF) methods. It is found that with a modern direct matrix solver, NR is more efficient and robust than the FDLF when tested over several different topological factors. The results and methodology presented herein are used to test the speed and robustness of algorithms that solve similar power system problems such as Optimal Power Flow.","abstract_html":"The purpose of this thesis is to expand the rigor of the development of new power flow solvers through graph generation. The use of the IEEE standard test cases as benchmarks is commonplace in literature, where they are used to demonstrate the effectiveness of new algorithms. This results in the use of as little as two to five grids with only tens or hundreds of nodes each. The sample size for these tests is very small and cannot fully represent the behavior of the algorithms being tested. Since this problem stems from the lack of real, publicly available grids, a solution is to generate power grids with the necessary components. This thesis is the first to compare the performance of numerical methods in this setting. Two popular numerical methods are considered: the Newton-Raphson (NR) and Fast Decoupled Load Flow (FDLF) methods. It is found that with a modern direct matrix solver, NR is more efficient and robust than the FDLF when tested over several different topological factors. The results and methodology presented herein are used to test the speed and robustness of algorithms that solve similar power system problems such as Optimal Power Flow.","abstract_has_math":false,"creators":["Hug, Adam"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Goddard, Lynford L."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-09-16T17:12:33Z","date_published":"2014-09-16T17:12:33Z","updated_at":"2026-07-22T22:25:40Z","subjects":["power grid topology","random power grid","generating power grid","random graph","random network","small-world","small world","power flow","load flow","numerical solver","verification"],"languages":["en"],"rights":["Copyright 2014 Adam Hug"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/50397","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Goddard, Lynford L."]},{"key":"dc:creator","label":"Author","values":["Hug, Adam"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-09-16T17:12:33Z","2016-09-22T20:59:28Z","2014-08","2014-09-16"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["power grid topology","random power grid","generating power grid","random graph","random network","small-world","small world","power flow","load flow","numerical solver","verification"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2014 Adam Hug"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/50397"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The purpose of this thesis is to expand the rigor of the development of new power flow solvers through graph generation. The use of the IEEE standard test cases as benchmarks is commonplace in literature, where they are used to demonstrate the effectiveness of new algorithms. This results in the use of as little as two to five grids with only tens or hundreds of nodes each. The sample size for these tests is very small and cannot fully represent the behavior of the algorithms being tested. Since this problem stems from the lack of real, publicly available grids, a solution is to generate power grids with the necessary components. This thesis is the first to compare the performance of numerical methods in this setting. Two popular numerical methods are considered: the Newton-Raphson (NR) and Fast Decoupled Load Flow (FDLF) methods. It is found that with a modern direct matrix solver, NR is more efficient and robust than the FDLF when tested over several different topological factors. The results and methodology presented herein are used to test the speed and robustness of algorithms that solve similar power system problems such as Optimal Power Flow.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-07-17T20:11:15Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Hug_Adam.zip: 4229184 bytes, checksum: ed13371555bfe8cea6285804387b8c94 (MD5) Hug_Adam.pdf: 3198482 bytes, checksum: d934123a03ffc68ded06c15d428e191c (MD5)","Made available in DSpace on 2014-09-16T17:12:33Z (GMT). No. of bitstreams: 3 Adam_Hug.pdf: 3198482 bytes, checksum: d934123a03ffc68ded06c15d428e191c (MD5) Hug_Adam.zip: 4229184 bytes, checksum: ed13371555bfe8cea6285804387b8c94 (MD5) license.txt: 4058 bytes, checksum: 4712eb2648ff20eda867fe31243643be (MD5)","Embargo set by: Seth Robbins for item 50508 Lift date: 2016-09-16T17:13:01Z Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Limited Restriction Lifted for Item 50508 on 2016-09-22T20:59:28Z."]},{"key":"dc:title","label":"Title","values":["Generating random power grids for the verification of new load flow solvers"]}]}],"canonical_facts":{"dc:contributor":["Goddard, Lynford L."],"dc:creator":["Hug, Adam"],"dc:date":["2014-09-16T17:12:33Z","2016-09-22T20:59:28Z","2014-08","2014-09-16"],"dc:description":["The purpose of this thesis is to expand the rigor of the development of new power flow solvers through graph generation. The use of the IEEE standard test cases as benchmarks is commonplace in literature, where they are used to demonstrate the effectiveness of new algorithms. This results in the use of as little as two to five grids with only tens or hundreds of nodes each. The sample size for these tests is very small and cannot fully represent the behavior of the algorithms being tested. Since this problem stems from the lack of real, publicly available grids, a solution is to generate power grids with the necessary components. This thesis is the first to compare the performance of numerical methods in this setting. Two popular numerical methods are considered: the Newton-Raphson (NR) and Fast Decoupled Load Flow (FDLF) methods. It is found that with a modern direct matrix solver, NR is more efficient and robust than the FDLF when tested over several different topological factors. The results and methodology presented herein are used to test the speed and robustness of algorithms that solve similar power system problems such as Optimal Power Flow.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-07-17T20:11:15Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Hug_Adam.zip: 4229184 bytes, checksum: ed13371555bfe8cea6285804387b8c94 (MD5) Hug_Adam.pdf: 3198482 bytes, checksum: d934123a03ffc68ded06c15d428e191c (MD5)","Made available in DSpace on 2014-09-16T17:12:33Z (GMT). No. of bitstreams: 3 Adam_Hug.pdf: 3198482 bytes, checksum: d934123a03ffc68ded06c15d428e191c (MD5) Hug_Adam.zip: 4229184 bytes, checksum: ed13371555bfe8cea6285804387b8c94 (MD5) license.txt: 4058 bytes, checksum: 4712eb2648ff20eda867fe31243643be (MD5)","Embargo set by: Seth Robbins for item 50508 Lift date: 2016-09-16T17:13:01Z Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Limited Restriction Lifted for Item 50508 on 2016-09-22T20:59:28Z."],"dc:identifier":["http://hdl.handle.net/2142/50397"],"dc:language":["en"],"dc:rights":["Copyright 2014 Adam Hug"],"dc:subject":["power grid topology","random power grid","generating power grid","random graph","random network","small-world","small world","power flow","load flow","numerical solver","verification"],"dc:title":["Generating random power grids for the verification of new load flow solvers"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:40Z"}