Price-Based Dynamic Optimal Power Flow With Emergency Repair
| العنوان: | Price-Based Dynamic Optimal Power Flow With Emergency Repair |
|---|---|
| المؤلفون: | William Ismael Schmitz, Vinicius Jacques Garcia, L. L. Pfitscher, Magdiel Schmitz, Daniel Pinheiro Bernardon, Martin Wolter |
| المصدر: | IEEE Transactions on Smart Grid. 12:324-337 |
| بيانات النشر: | Institute of Electrical and Electronics Engineers (IEEE), 2021. |
| سنة النشر: | 2021 |
| مصطلحات موضوعية: | Mathematical optimization, General Computer Science, Linear programming, Computational complexity theory, Job shop scheduling, Computer science, business.industry, 020209 energy, 020208 electrical & electronic engineering, Scheduling (production processes), 02 engineering and technology, Dynamic priority scheduling, Maintenance engineering, Distributed generation, 0202 electrical engineering, electronic engineering, information engineering, Benchmark (computing), business |
| الوصف: | In a scenario involving damaged lines or equipment, healthy regions of a network with distributed energy resources can operate through islanded microgrids. With this, the hourly demand constraint is flexible and the dynamic optimal power flow (DOPF) follows a price signal, making use of inter-temporal technologies to maximize the power utility’s profit; this is known as price-based DOPF (PB-DOPF). Repair crews must also be dispatched to affected locations when restoring the network, which is known as the emergency order (EO) scheduling problem. This article proposes a mathematical model for co-optimization of the interdependent PB-DOPF and EO scheduling problems, in order to minimize the PB-DOPF cost in a horizon. The problem is formulated as a mixed-integer linear programming model with linearized three-phase power flow. An algorithm is implemented to perform the PB-DOPF and repair crew dispatches over a horizon with multiple EOs incidences, integrating a pre-scheduling methodology to handle the computational complexity. The optimization process focuses on systematically improving the solution by releasing the route and keeping track of the results related to the solution progress. Computational tests are carry on IEEE 123-bus and IEEE 8500-node distribution systems, constructing the benchmark cases with the proposed algorithm and its other two variations. |
| تدمد: | 1949-3061 1949-3053 |
| DOI: | 10.1109/tsg.2020.3018640 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::20b3e80f3cf4af40dcd6a5a8d6946010 https://doi.org/10.1109/tsg.2020.3018640 |
| Rights: | CLOSED |
| رقم الانضمام: | edsair.doi...........20b3e80f3cf4af40dcd6a5a8d6946010 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 19493061 19493053 |
|---|---|
| DOI: | 10.1109/tsg.2020.3018640 |