Ph.D. Dissertation Defense - Bai Cui

*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************

Event Details
  • Date/Time:
    • Friday July 20, 2018 - Saturday July 21, 2018
      10:00 am - 11:59 am
  • Location: Room 1212, Klaus
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: Distribution System Service Restoration by Dynamic Programming Considering Switch Characteristics

Full Summary: No summary paragraph submitted.

TitleDistribution System Service Restoration by Dynamic Programming Considering Switch Characteristics

Committee:

Dr. Sakis Meliopoulos, ECE, Chair , Advisor

Dr. Andy Sun, ISyE

Dr. Maryam Saeedifard, ECE

Dr. Ying Zhang, ECE

Dr. Lukas Graber, ECE

Dr. Shijie Deng, ISyE

Abstract:

The objective of the proposed research is to develop a systematic approach of finding the optimal switching sequence leading to optimal post-fault topology in distribution system restoration (DSR) problem. The purpose of DSR is to reconfigure the topology of distribution system through switching actions to restore power to customers subject to system faults. Many existing methods formulate DSR problems as single-step optimization problem where the only control devices are remotely controllable sectionalizers. The problem with this approach is that when various kinds of switches are present in the distribution system, certain sequence of switching actions need to be followed based on the different characteristics of the switches, which is not considered by the single-step optimization formulations. To the best of our knowledge, there hasn't been research reported in the literature that considers the characteristics of switches and couples the constraints in the optimization problem to derive feasible switching sequences in a systematic and mathematically rigorous way. By formulating the DSR problem as a dynamic programming (DP) problem, the solution can be found in a systematic way with guaranteed optimality. Switch current limits as well as system operational constraints are considered in the formulation. Scalability to larger systems and related computational issues are discussed. 

Additional Information

In Campus Calendar
No
Groups

ECE Ph.D. Dissertation Defenses

Invited Audience
Public
Categories
Other/Miscellaneous
Keywords
Phd Defense, graduate students
Status
  • Created By: Daniela Staiculescu
  • Workflow Status: Published
  • Created On: Jul 3, 2018 - 12:44pm
  • Last Updated: Jul 11, 2018 - 3:45pm