A chance constrained dynamic network reconfiguration based on Minty algorithm in distribution networks-Reference-Cited by-同舟云学术

A chance constrained dynamic network reconfiguration based on Minty algorithm in distribution networks

Published:2023-09-09 Issue:1 Volume:9 Page:
ISSN:2444-8656
Container-title:Applied Mathematics and Nonlinear Sciences
language:en
Short-container-title:

Author:

Song Xinfu¹,Li Changling¹,Yi Geng¹,Zhong Rui¹,Wang Wei²

Affiliation:

1. 1 Economic Research Institute, State Grid Xinjiang Electric Power Company , Urumqi , Xinjiang , , China

2. 2 College of Intelligent Equipment , Shandong University of Science and Technology , Tai’an , Shadong , , China .

Abstract

Abstract With high renewable energy sources (RESs) penetration in distribution networks, handling the uncertainties of RESs outputs and multi-time coupling problems in the dynamic network reconfiguration (DNR) is a big challenge. Besides, the existing mathematical and artificial intelligence algorithms for network reconfiguration face the problem of falling into local optima and poor convergence. To address the above challenge and problem, this paper first establishes a chance-constrained programming model to handle the uncertainties. Then the Minty algorithm is applied for efficiency and accurate static network reconfiguration (SNR) in each time interval. Finally, a branch exchange-based method is proposed to eliminate violations for the operation times of switches. Numerical simulations on the IEEE 33 system and an actual 151-bus distribution network show the superiority of the proposed algorithm over existing methods.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Engineering (miscellaneous),Modeling and Simulation,General Computer Science

Link

https://www.sciendo.com/pdf/10.2478/amns.2023.2.00304

Reference33 articles.

1. Merlin, A., & Back, H. (1975). Search for a minimum-loss operating spanning tree configuration for an urban power distribution system. In: Proceedings of the 5th Power Systems Computer Conference, September 1–5, 1975.

2. Baran, M. E., & Wu, F. F. (1989). Network reconfiguration in distribution systems for loss reduction and load balancing. IEEE Transactions on Power Delivery, 4(2), 1401–1407.

3. Shirmohammadi, D., & Hong, H. W. (1989). Reconfiguration of electric distribution networks for resistive line losses reduction. IEEE Transactions on Power Delivery, 4, 1492–1498.

4. Chiang, H. D., & Jean-Jumeau, R. (1990). Optimal network reconfigurations in distribution systems I. A new formulation and a solution methodology. IEEE Transactions on Power Delivery, 5, 1902–1909.

5. Olamaei, J., Niknam, T., & Gharehpetian, G. (2008). Application of particle swarm optimization for distribution feeder reconfiguration considering distributed generators. Applied Mathematics and Computation, 201, 575–586.