An efficient heuristic algorithm for reconfiguration based on branch power flows direction

This paper presents a meshed algorithm for optimal reconfiguration of distribution systems. In the reconfiguration problem, the final objective is to reach a radial network that optimizes some function like the network losses. Many algorithms start from a radial network where a switch closure is complemented by opening of another switch to ensure a radial network. These radial algorithms have an inherent inconvenient, that is, the final solution depends on the initial radial network selected. Other group of algorithms initially represent the distribution network as a meshed network and then open switches until a radial system is obtained. In this paper, to avoid the above aforementioned inconvenient of radial algorithms, a meshed algorithm is used. Furthermore, taking into account that breakpoint nodes are defined as the nodes where the branch power flows converge, the contribution of this paper is to provide a method for solving the problem when multiple loops are considered using an approach based on the breakpoint nodes, since it is complicated to associate each breakpoint node with its corresponding loop. On the other hand, one of the drawbacks of the reconfiguration problem is the need to solve a great number of power flow computations for calculating the losses in each stage of the algorithm. The algorithm proposed has the property that reduces the number of power flows. By this way, the execution time of the algorithm is improved. Besides, it is not necessary to check the network connectivity at each step of the procedure. To prove the effectiveness of the proposed algorithm several test systems have been used, achieving good results.     

Distribution system reconfiguration using a modified Tabu Search algorithm

This article presents an efficient meta-heuristic method for reconfiguration of distribution systems. A modified Tabu Search (MTS) algorithm is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off sectionalizing switches. TS algorithm is introduced with some modifications such as using a tabu list with variable size according to the system size. Also, a random multiplicative move is used in the search process to diversify the search toward unexplored regions. The Kirchhoff algebraic method is adopted to check the radial topology of the system. A salient feature of the MTS method is that it can quickly provide a global optimal or near-optimal solution to the network reconfiguration problem. To verify the effectiveness of the proposed approach, the effect of load variation is taken into consideration and comparative studies are conducted on three test systems with rather encouraging results. The obtained results, using the proposed MTS approach, are compared with that obtained using other approaches in the previous work.     

Optimal reconfiguration of distribution systems with representation of uncertainties through interval analysis

The present work presents an approach for optimal reconfiguration of electrical distribution systems (EDS) to minimize energy losses considering uncertainties in the load demand and in the wind based distributed generation (DG). The optimization algorithm applied to solve the reconfiguration problem is based on the bio-inspired metaheuristic Artificial Immune Systems (AIS). An interval power flow model is used to obtain an interval energy loss from the representation of the uncertainties. The interval loss is used to guide the AIS algorithm through the search space. Network and operational constraints as the radiality and connectivity of the network as well as different load levels are considered. Well-known test systems are used to assess the impact of the uncertainties representation in the reconfiguration problem.     

基于搜索-回溯法的配电网重构的研究

配电网重构是降低线损的有效途径,为此,介绍了将搜索-回溯法和广度优先搜索算法用于配电网重构问题的研究,重点论述了环的搜索、组合搜索、辐射状网络结构搜索这三个主要问题,并通过对算例的演算,验证了程序求解配电网重构问题的有效性和可行性。     

Analysis of the radial operation of distribution systems considering operation with minimal losses

Electric power distribution systems, and particularly those with overhead circuits, operate radially but as the topology of the systems is meshed, therefore a set of circuits needs to be disconnected. In this context the problem of optimal reconfiguration of a distribution system is formulated with the goal of finding a radial topology for the operation of the system. This paper utilizes experimental tests and preliminary theoretical analysis to show that radial topology is one of the worst topologies to use if the goal is to minimize power losses in a power distribution system. For this reason, it is important to initiate a theoretical and practical discussion on whether it is worthwhile to operate a distribution system in a radial form. This topic is becoming increasingly important within the modern operation of electrical systems, which requires them to operate as efficiently as possible, utilizing all available resources to improve and optimize the operation of electric power systems. Experimental tests demonstrate the importance of this issue.     

Comments on “A new heuristic approach for optimal reconfiguration in distribution systems” in 81 (2011) 282-289

This short communication is a discussion of the paper entitled “A new heuristic approach for optimal reconfiguration in distribution systems” introduced a new approach for optimal reconfiguration of radial distribution systems. Besides, a load flow algorithm based on graph theory was presented in order to give precise branch currents, node voltages and system power losses. In the abstract and in the conclusion section of the above mentioned study, the author stated that the results show that the performance of the proposed method is better than that of several methods available in other published articles, and that the proposed technique represents an improved, more efficient method which can easily solve the distribution network reconfiguration problem compared with those other methods. However, this conclusion can not be deduced from the results given by the author because with the optimal radial configuration given for the test system used, the power losses obtained are higher than those obtained by some of the other methods. So, the proposed final solution is worse.     

考虑综合需求响应的配电网重构运行优化研究

重构运行优化决策灵活性是智能配电网的重要特征之一,随着配网侧多能源形式相互耦合的不断增强,以能量枢纽为代表的综合能源转换装置受到广泛关注.如何在配电网重构优化运行中考虑能量枢纽运行特性,为配电网与用户用能带来更多的灵活性与经济性等相关研究亟待开展.提出了一种考虑综合能源需求响应的配电网重构优化决策模型,将传统的电力用户侧需求响应扩展到多种能源网络用户的综合能源需求响应,将综合能源需求响应与配电网重构优化运行进行协同决策,实现配电网与整体用户整体最优的目标.算例验证了模型算法的有效性.     

考虑环网检测的配电网拓扑重构遗传算法

提出了一种基于遗传算法的配电网自动优化重构方法。由于配电网拓扑约束的限制(连通辐射状网络),遗传算法在解决配电网重构问题过程中,可能产生大量不可行解。针对该问题,首先提出了一种快速"环网和孤立节点"检测算法,可检测进化过程中产生的解是否满足配电网拓扑约束的要求;其次,提出了一种基于拓扑搜索的初始种群自动形成算法,该算法除可用于初始种群的形成外,还可用于生成新的解以替代遗传进化过程中产生的不可行解。为了提高遗传算法的收敛性能,提出了一种定向变异的遗传算子,该算子不仅可保证经变异运算后产生的个体满足配电网拓扑约束的要求,而且可保证该个体为本次变异操作可产生的最优解。该算法的提出提高了遗传算法解决重构问题的自动化程度和收敛性能。以IEEE 33节点、PGE 69节点和119节点系统为例对方法进行了测试,验证了该方法的有效性。     

Implementation of genetic algorithm for distribution systems lossminimum re-configuration

The loss minimum reconfiguration problem in the open loop radial distribution system is basically one of complex combinatorial optimization, since the normal open sectionalizing switches must be determined appropriately. The genetic algorithm was successfully applied to the loss minimum reconfiguration problem. In the proposed algorithm, strings consist of sectionalizing switch status or radial configurations, and the fitness function consists of the total system losses and penalty value of voltage drop and current capacity violations. The loss minimum reconfiguration problem is formulated as a mixed integer programming problem. The essential components of the genetic algorithm are briefly described. A detailed solution methodology by the use of genetic algorithm is outlined. Numerical examples demonstrate the validity and effectiveness of the proposed methodology     

Oppositional krill herd algorithm for optimal location of capacitor with reconfiguration in radial distribution system

The delivery of power from sources to the consumer points is always accompanied of power losses. Basically, active losses in distribution systems can be reduced by optimal reconfigurations of the network. Optimal capacitor allocation problem in reconfigured distribution network is a challenge of researchers for several decades. This paper presents a computationally efficient methodology namely, krill herd (KH) algorithm to find optimal location of capacitor and optimal reconfiguration in order to minimize real power loss of radial distribution systems. Moreover, the opposition based learning (OBL) concept is integrated with KH algorithm for improving the convergence speed and simulation results. In order to show the usefulness and supremacy, the conventional KH and proposed oppositional KH (OKH) algorithms are tested on 33-bus and 69-bus radial distribution networks. The simulation results of the proposed methods are compared with fuzzy multi-objective approach and non dominated sorting genetic algorithm (NSGA). The solution results show that OKH technique could generate better quality solutions and better convergence characteristics than those obtained by conventional KH algorithm and other existing optimization techniques available in the literature. Results also show the robustness of the proposed methodology to solve reconfigured distribution network (RDN) problems.     

基于供电成本最小的配电网重构

在电力市场环境下,针对多电源供电网络,各电源点购电价格不同时,重构方案不再依赖于传统的以网损最小为目标。为了考虑配电网系统的供电成本最小（效益最大）问题,提出了一种基于供电成本最小的配电网重构算法。结合考虑电源点购电价格差别的改进支路交换算法,使用近似网损代替精确网损,避免了使用复杂的启发式规则,能够迅速确定重构的网络拓扑,重构过程中无需进行潮流计算,降低了问题求解复杂度。算例结果表明所提算法简单实用,对寻找网络的经济运行结构具有参考意义。     

Optimal Reconfiguration in Radial Distribution System Using Gravitational Search Algorithm

This article presents an innovative technique for solving network reconfiguration problems with an objective of minimizing network I²R losses for an explicit set of loads. Amid many performance standards considered for optimal network reconfiguration, voltage constraint is an important one. This problem calls for determining the best combination of feeders to be opened in the radial distribution system so it provides optimal performance in the preferred settings. In solving this problem, the gravitational search algorithm is used to reconfigure the radial distribution system; this algorithm practices an optimal pattern for sustaining the radial nature of the network at every stage of the solution, and it further allows proficient exploration of the solution space. The anticipated scheme minimizes the objective function, which has been given in the problem formulation to reduce I²R losses in addition to balancing loads in the feeders. The solution technique involves determination of the best switching combinations and calculation of power loss and voltage profile. The practicality of the anticipated technique is validated in two distribution networks, where attained results are compared by means of available literature. Correspondingly, it is seen from the results that network losses are reduced when voltage stability is enriched through network reconfiguration.     

提升分布式电源接纳能力的配电网三相鲁棒动态重构

不可控分布式电源(UDG)给主动配电网带来了显著的功率波动和不确定性。为消纳更多的UDG,主动配电网的拓扑结构应随系统的运行工况动态灵活配置。此外,由于配电系统的负荷通常是三相不平衡的,实际应用中也需要计及网络三相不平衡的重构模型。对此,基于自适应二阶段鲁棒优化方法,提出了一种三相不平衡配电网的动态重构方法。其中,第一阶段为在考虑的整个重构超前时段内优化网络的拓扑,以减少日常的开关费用并保持网络的辐射状结构。第二阶段为基于给定的网络拓扑和UDG出力不确定集合,通过执行三相动态最优潮流来最小化系统最坏情况下的运行成本。所提二阶段鲁棒动态重构模型可采用列与约束生成算法进行求解,并且线性三相潮流模型的采用,使主问题与子问题均可建模为混合整数线性规划问题。通过对修改的IEEE 34节点及IEEE 123节点系统的测试计算,验证了所提方法的有效性。     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.     

Optimal switching sequence path for distribution network reconfiguration considering different types of distributed generation

Minimizing power losses in a distribution system is commonly realized through optimal network reconfiguration. In the past, network reconfiguration research was focused on planning, where the final configuration with the lowest power losses was the main goal. However, power losses during switching operations from the initial state to the final state of the configuration were not considered. This paper presents the optimal switching sequence path to minimize power losses during the network switching operation. Apart from this contribution, the simultaneous optimal network reconfiguration for variable load network and distributed generation (DG) output is also proposed. The proposed methodology involves the (i) optimal network reconfiguration with variable load and DG output simultaneously, and (ii) the optimal sequence of switching operations required to convert the network from the original configuration to the optimal configuration obtained from (i). The selected optimization technique in this work is the firefly algorithm. To assess the capabilities of the proposed method, simulations using MATLAB are carried out on IEEE 33‐bus radial distribution networks. The results demonstrate the effectiveness of the proposed strategy to determine the sequence path of switching operations, as well as the optimal network configuration and optimal output of DG units. © 2017 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

含放射性约束条件的配电网重构研究

研究网络重构是配电网运行及优化的重要功能之一,在各种重构算法中,网络模型通常采用放射性的拓扑结构。为保证重构结构满足拓扑的放射性约束,把放射约束的数学模型纳入到含分布式电源(DG)的网络重构系统中,使以往复杂的方法转化为一个简单而有效的方法。进而把该放射性约束条件运用于基于粒子群优化算法的配电网重构中,克服了粒子群寻优的盲目性,提高运算速度。最后通过IEEE33和IEEE69节点算例表明,放射性条件的约束和DG的引入能够更进一步实现整个网络重构方案的优化。     

Reconfiguration of distribution networks to minimize loss and disruption costs using genetic algorithms

In this paper a computational implementation of an evolutionary algorithm (EA) is shown in order to tackle the problem of reconfiguring radial distribution systems. The developed module considers power quality indices such as long duration interruptions and customer process disruptions due to voltage sags, by using the Monte Carlo simulation method. Power quality costs are modeled into the mathematical problem formulation, which are added to the cost of network losses. As for the EA codification proposed, a decimal representation is used. The EA operators, namely selection, recombination and mutation, which are considered for the reconfiguration algorithm, are herein analyzed. A number of selection procedures are analyzed, namely tournament, elitism and a mixed technique using both elitism and tournament. The recombination operator was developed by considering a chromosome structure representation that maps the network branches and system radiality, and another structure that takes into account the network topology and feasibility of network operation to exchange genetic material. The topologies regarding the initial population are randomly produced so as radial configurations are produced through the Prim and Kruskal algorithms that rapidly build minimum spanning trees.     

基于混合算法的含分布式电源配电网重构研究

随着新能源技术在配电网领域的发展,分布式电源（distributed generation,DG）接入配电网的研究成为热门。与传统配电网相比,含DG的配电网会出现弱环网和非PQ节点,而传统潮流计算方法只能解决PQ节点和辐射状网络。为解决配电网接入DG后重构的问题,采用叠加定理解决开关倒换过程中产生的弱环网,同时改进前推回代潮流计算方法,使得接入DG的节点可以正常参与潮流计算。同时结合纵横交叉算法（crisscross optimization,CSO）和粒子群算法（particle swarm optimization,PSO）的优势,提出混合算法（crisscross particle swarm optimization, CPSO）优化含分布式电源的配电网重构问题。仿真部分是以典型的IEEE 33节点配电网为例,在考虑DG接入方式为PI节点、PV节点和PQ（V）节点的情况下进行仿真,结果证明了配电网合理的接入DG后,可以起到降低网损和提高电压质量的作用。     

Multi-objective feeder reconfiguration by distribution managementsystem

Feeder reconfiguration for use by distribution management systems is discussed in this paper. Multiple objectives are proposed to reflect realistic operating environments while achieving all benefits from feeder reconfiguration. The multiple objectives considered are minimization of power losses, load balancing among supply transformers, minimization of the worst voltage drop, minimization of service interruption frequency, and balanced service of important customers for enhanced service reliability. The objective function containing five different objectives are optimized subject to capacity and protection device constraints. The overall solution approach is a two-stage process. In the first stage, a suboptimal solution is found by analyzing the mesh distribution system in which all open switches are simulated to be closed. Applying special power flow analyses to this mesh network, a radial distribution system is determined as an intermediate solution. In the second stage, this solution is continuously improved by the branch exchange scheme. Special topology models are also developed to accelerate the search procedure. Use of the algorithm is illustrated by numerical examples