Loss-Minimized Distribution System Reconfiguration by Using Improved Multi-agent Based Particle Swarm Optimization

Author(s):  
Hong-Tzer Yang ◽  
Yi-Te Tzeng ◽  
Men-Shen Tsai

Distribution system reconfiguration is done by altering the open / close position of two kinds of switches: usually open tie switches and sectionalizing switches usually closed. Its main purpose is restoration of supply via other route to improve reliability, sometimes for load balancing by relieving overloads. Feeder reconfiguration is very good alternative to reduce power losses and improve voltage profile to improve overall performance. Distribution system reconfiguration is a very cost effective way to reduce the distribution system power losses, enhance voltage profile and system reliability. This paper presents application of novel Discrete - improved binary particle swarm optimization (D-IBPSO) algorithm for distribution system reconfiguration for minimization of real power loss and improvement of voltage profile. The algorithm is implemented to a 16-bus, 33-bus system and a 69-bus system considering different loading conditions. The simulation results indicate that the suggested technique can accomplish optimal reconfiguration and significantly reduce power losses on the supply scheme and enhance the voltage profile.


2011 ◽  
Vol 110-116 ◽  
pp. 5206-5210
Author(s):  
K.Ravi Kumar ◽  
S. Anand ◽  
M. Sydulu

This paper proposes a comparison of new evolutionary multi agent based particle swarm optimization algorithms for solving optimal power flows with security constraints (line flows and bus voltages). These methods combine the multi agents in two dimensional and cubic lattice structures with particle swarm optimization (PSO) to form two new algorithms. In both Two Dimensional Lattice Structured Multi Agent based Particle Swarm Optimization (TDLSMAPSO) and Cubic Lattice Structured Multi Agent based Particle Swarm Optimization (CLSMAPSO), an agent represents a particle in cubic lattice structure to PSO, and a candidate solution to the OPF problem. All agents live in a square and cubic lattice like environments, with agents fixed on a lattice point in the ascending order of their fitness value. In order to obtain the optimal solution, each agent in cubic and square lattice competes and cooperates with its neighbors. Making use of these agent-agent interactions, CLSMAPSO and TDLSMAPSO realizes the purpose of minimizing the objective function value. CLSMAPSO and TDLSMAPSO realizations were applied to IEEE 30 bus system. Simulation results show that proposed approaches gives better solution than earlier reported approaches in quick time.


Sign in / Sign up

Export Citation Format

Share Document