University of SaskatchewanHARVEST
  • Login
  • Submit Your Work
  • About
    • About HARVEST
    • Guidelines
    • Browse
      • All of HARVEST
      • Communities & Collections
      • By Issue Date
      • Authors
      • Titles
      • Subjects
      • This Collection
      • By Issue Date
      • Authors
      • Titles
      • Subjects
    • My Account
      • Login
      JavaScript is disabled for your browser. Some features of this site may not work without it.
      View Item 
      • HARVEST
      • Electronic Theses and Dissertations
      • Graduate Theses and Dissertations
      • View Item
      • HARVEST
      • Electronic Theses and Dissertations
      • Graduate Theses and Dissertations
      • View Item

      Microgrid Formation-based Service Restoration Using Deep Reinforcement Learning and Optimal Switch Placement in Distribution Networks

      Thumbnail
      View/Open
      AFSHARIIGDER-THESIS-2023.pdf (3.172Mb)
      Date
      2023-05-24
      Author
      Afshari Igder, Mosayeb
      Type
      Thesis
      Degree Level
      Masters
      Metadata
      Show full item record
      Abstract
      A power distribution network that demonstrates resilience has the ability to minimize the duration and severity of power outages, ensure uninterrupted service delivery, and enhance overall reliability. Resilience in this context refers to the network's capacity to withstand and quickly recover from disruptive events, such as equipment failures, natural disasters, or cyber attacks. By effectively mitigating the effects of such incidents, a resilient power distribution network can contribute to enhanced operational performance, customer satisfaction, and economic productivity. The implementation of microgrids as a response to power outages constitutes a viable approach for enhancing the resilience of the system. In this work, a novel method for service restoration based on dynamic microgrid formation and deep reinforcement learning is proposed. To this end, microgrid formation-based service restoration is formulated as a Markov decision process. Then, by utilizing the node cell and route model concept, every distributed generation unit equipped with the black-start capability traverses the power system, thereby restoring power to the lines and nodes it visits. The deep Q-network is employed as a means to achieve optimal policy control, which guides agents in the selection of node cells that result in maximum load pick-up while adhering to operational constraints. In the next step, a solution has been proposed for the switch placement problem in distribution networks, which results in a substantial improvement in service restoration. Accordingly, an effective algorithm, utilizing binary particle swarm optimization, is employed to optimize the placement of switches in distribution networks. The input data necessary for the proposed algorithm comprises information related to the power system topology and load point data. The fitness of the solution is assessed by minimizing the unsupplied loads and the number of switches placed in distribution networks. The proposed methods are validated using a large-scale unbalanced distribution system consisting of 404 nodes, which is operated by Saskatoon Light and Power, a local utility in Saskatoon, Canada. Additionally, a balanced IEEE 33-node test system is also utilized for validation purposes.
      Degree
      Master of Science (M.Sc.)
      Department
      Electrical and Computer Engineering
      Program
      Electrical Engineering
      Supervisor
      Liang, Xiaodong
      Committee
      Faried, Sherif; Bui, Francis Bui
      Copyright Date
      2023
      URI
      https://hdl.handle.net/10388/14700
      Subject
      Service Restoration
      Deep Reinforcement Learning
      Collections
      • Graduate Theses and Dissertations
      University of Saskatchewan

      University Library

      The University of Saskatchewan's main campus is situated on Treaty 6 Territory and the Homeland of the Métis.

      © University of Saskatchewan
      Contact Us | Disclaimer | Privacy