Research of the Algorithms for Service Restoration Reconfiguration in Distribution Network

2015 ◽  
Vol 734 ◽  
pp. 491-494
Author(s):  
Jun Feng Wang

The purpose of this paper is to propose a mixed integer programming model of service restoration reconfiguration considering the minimum switching frequency and power losses. The recovery after the service failure of distribution network is a multi-objective optimization problem with constraints. This paper also discusses the reconfiguration algorithms for power restoration and load balancing in the real-time operation environment of distribution network, which can make the problem solving easy to handle and control. The methods and measures for service auto restoration in distribution automation system are analyzed by examples.

2014 ◽  
Vol 971-973 ◽  
pp. 1431-1434
Author(s):  
Yan Hong Li ◽  
Zhi Rong Zhang

Whena fault of the distribution network has occurred, it is necessary to pinpointthe type of the fault and its location and to isolation the fault by sectionswitches. It is then the task toattempts to restore service to as many unfaulted sections of the feeder aspossible via the available sources. Torestore feeder sections, the feeder must be bothering least one backup sourcewith sufficient capacity to bear the additional load. A method based on the backup feeder loadbalancing is proposed and software is developed. The service restores software obtains thedistribution operation data from distribution automation system (SCADA) and thefeeder parameters from power grid production management system (GPMS). Then compares that loads with the sparecapacity for backup sources and bring out the service restoration plan for thedispatch staff.


2013 ◽  
Vol 303-306 ◽  
pp. 1276-1279
Author(s):  
Hai Na Rong ◽  
Yan Hui Qin

Power network reconfiguration is an important process in the improvement of operating conditions of a power system and in planning studies, service restoration and distribution automation when remote-controlled switches are employed. This paper presents the use of a quantum-inspired evolutionary algorithm to solve the distribution network reconfiguration problem. The quantum- inspired evolutionary algorithm is the combination product of quantum computing and evolutionary computation and is suitable for a class of integer programming problems such as the distribution network reconfiguration problem. After the analysis and formulation of the distribution network reconfiguration problem, the effectiveness and feasibility of the introduced method is verified by a large number of experiments.


Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2318
Author(s):  
Islem Snoussi ◽  
Nadia Hamani ◽  
Nassim Mrabti ◽  
Lyes Kermad

In this paper, we propose robust optimisation models for the distribution network design problem (DNDP) to deal with uncertainty cases in a collaborative context. The studied network consists of collaborative suppliers who satisfy their customers’ needs by delivering their products through common platforms. Several parameters—namely, demands, unit transportation costs, the maximum number of vehicles in use, etc.—are subject to interval uncertainty. Mixed-integer linear programming formulations are presented for each of these cases, in which the economic and environmental dimensions of the sustainability are studied and applied to minimise the logistical costs and the CO2 emissions, respectively. These formulations are solved using CPLEX. In this study, we propose a case study of a distribution network in France to validate our models. The obtained results show the impacts of considering uncertainty by comparing the robust model to the deterministic one. We also address the impacts of the uncertainty level and uncertainty budget on logistical costs and CO2 emissions.


2010 ◽  
Vol 21 (1) ◽  
pp. 239-253 ◽  
Author(s):  
Chia-Hung Lin ◽  
Chao-Shun Chen ◽  
Te-Tien Ku ◽  
Cheng-Ta Tsai ◽  
Chin-Ying Ho

Sign in / Sign up

Export Citation Format

Share Document