Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
An Offline Strategic Planning for Service Restoration Using Multi-Constraints Priority-Based Dijkstra’s Algorithm
Island action of a partitioning distribution network with the Black Start Unit (BSU) reflects an effective improvement in the reliability and security of power systems during restoration. Present article efforts to address the subject of island partitioning in the distribution network with the predefined size of BSU. A new algorithm for Service Restoration is used in the proposed solution by sectionalizing the entire power network into island parts so that each prior load and non-black-start generating station receives power from the BSU with the minimum number of switching operations. The priority-based multi-constraints Dijkstra’s algorithm was used to identify the best partitioning solution. The suggested partitioning solution is evaluated through a study with the IEEE 39 bus and IEEE 118 bus test model and validation also carried out using MI-Power and PSAT analytical toolbox. The result reveals that the suggested solution accomplishes well regarding assuring the consistent supply to prior loads with the acceptable voltage stability and the least amount of power losses.
An Offline Strategic Planning for Service Restoration Using Multi-Constraints Priority-Based Dijkstra’s Algorithm
Island action of a partitioning distribution network with the Black Start Unit (BSU) reflects an effective improvement in the reliability and security of power systems during restoration. Present article efforts to address the subject of island partitioning in the distribution network with the predefined size of BSU. A new algorithm for Service Restoration is used in the proposed solution by sectionalizing the entire power network into island parts so that each prior load and non-black-start generating station receives power from the BSU with the minimum number of switching operations. The priority-based multi-constraints Dijkstra’s algorithm was used to identify the best partitioning solution. The suggested partitioning solution is evaluated through a study with the IEEE 39 bus and IEEE 118 bus test model and validation also carried out using MI-Power and PSAT analytical toolbox. The result reveals that the suggested solution accomplishes well regarding assuring the consistent supply to prior loads with the acceptable voltage stability and the least amount of power losses.
An Offline Strategic Planning for Service Restoration Using Multi-Constraints Priority-Based Dijkstra’s Algorithm
J. Inst. Eng. India Ser. B
Sarkar, Dipu (Autor:in) / Chakrabarty, Maitrayee (Autor:in) / Ghosh, Ritwik (Autor:in) / Basak, Raju (Autor:in)
Journal of The Institution of Engineers (India): Series B ; 101 ; 309-320
01.08.2020
12 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm
| DOAJ | 2016
Dijkstra's algorithm-based ray tracing method for total focusing method imaging of CFRP laminates
| British Library Online Contents | 2019