• Aucun résultat trouvé

Hybrid PSO algorithm for the solving of the Optimal Reactive Power Problem

N/A
N/A
Protected

Academic year: 2021

Partager "Hybrid PSO algorithm for the solving of the Optimal Reactive Power Problem"

Copied!
3
0
0

Texte intégral

(1)

HAL Id: hal-03127204

https://hal-uphf.archives-ouvertes.fr/hal-03127204

Submitted on 10 Feb 2021

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Hybrid PSO algorithm for the solving of the Optimal Reactive Power Problem

Zahir Sahli, Abdelghani Bekrar, Damien Trentesaux

To cite this version:

Zahir Sahli, Abdelghani Bekrar, Damien Trentesaux. Hybrid PSO algorithm for the solving of the Op-

timal Reactive Power Problem. International Conference on Swarm Intelligence Based Optimization

(ICSIBO’2014), May 2014, Mulhouse, France. pp. 45-46. �hal-03127204�

(2)

adfa, p. 1, 2011.

© Springer-Verlag Berlin Heidelberg 2011

Hybrid PSO algorithm for the solving of the Optimal Reactive Power Problem

Zahir Sahlia, Abdelghani Bekrarb, Damien Trentesauxb

aDepartment of Electrotechnics, QUERE Laboratory Ferhat Abbas Sétif 1 University, Sétif, Algeria

Sah_zah@yahoo.fr

bUVHC, TEMPO lab, EA 4542, PSI Team, F-59313 Valenciennes, France

abdelghani.bekrar@univ-valenciennes.fr, Damien.Trentesaux@univ-valenciennes.fr

Keywords: Mixed non-linear problem, Particle Swarm Optimization (PSO), hybrid method, Optimal Reactive Power Dispatch.

Abstract.

A power system is a complex network used for generating and transmitting electric power. It is expected to operate with consumption of minimal resources giving maxi- mum security and reliability. The Optimal Power Flow (OPF) is an important problem to be solved to help the operator to achieve these goals (minimal resources consump- tion with maximum security and reliability) by providing the optimal settings of all controllable variables. Optimal Reactive Power Dispatch (ORPD) is a special case of OPF problem in which, control parameters are the variables which have a close rela- tionship with the reactive power flow, such as generator bus voltages, output of static reactive power compensators, transformer tap-settings, shunt capacitors/reactors, etc[1]. Because of its significant influence on the secure and economic operation of power systems, ORPD has received an ever-increasing interest from electric utilities.

The objective is to minimize the network real power loss and to improve the voltage profile, while satisfying a given set of operating and physical constraints. Because that outputs of shunt capacitors/reactors and tap-settings of transformers are discrete variables while other parameters in ORPD are continuous, the reactive power dispatch problem can be modeled as a mixed integer non-linear programming problem [2].

To solve the ORPD problem, meta-heuristics has been widely used [3]. Among these meta-heuristics, the Particle Swarm Optimization (PSO) is used in many papers, see for example [4,5,6]. The PSO was also hybridized with other method to avoid its premature convergence. However, a survey made on relevant published papers has

(3)

shown many lacks, especially regarding the implementation of the algorithm, the definition of the problem objectives and the considered constraints, the experimental design and the comparison of the proposed algorithms with other techniques.

In this paper, a critical overview of the papers using PSO to solve ORPD problem is first realized. A methodology to model this problem and to fix objectives and the different constraints is then defined and a new approach to solve the ORPD problem based on hybridizing the Particle Swarm Optimization and Tabu-search (PSO-TS) is proposed. This hybridization has never been used for the ORDP problem. We test and analyze different tuning of PSO-TS parameters. A comparative study is finally im- plemented on different IEEE network systems with other evolutionary algorithms to show the consistency and the performances of the proposed hybridization.

References

1. Alireza Abbasy Seyed Hamid Hosseini, "Ant Colony Optimization-Based Approach to Optimal Reactive Power Dispatch: A Comparison of Various Ant Systems", IEEE PES Power Africa 2007 - Conference and Exhibition Johannesburg, South Africa, 16-20 July 2007.

2. B. Zhao, C. X. Guo, and Y. J. Cao, "A Multiagent-Based Particle Swarm Optimization Approach for Optimal Reactive Power Dispatch", IEEE Transactions on Power Systems, Vol.20, NO.2, MAY 2005.

3. S. Frank, I. Steponavice, and S. Rebennack, « Optimal power flow: a bibliographic survey II », Energy Syst, vol. 3, no 3, p. 259-289, sept. 2012.

4. Badar, A.Q.H., Umre, B.S., and Junghare, A.S. (2012). Reactive power control using dy- namic Particle Swarm Optimization for real power loss minimization. International Journal of Electrical Power & Energy Systems 41, 133–136.

5. Hinojosa, V.H., and Araya, R. (2013). Modeling a mixed-integer-binary small-population evolutionary particle swarm algorithm for solving the optimal power flow problem in elec- tric power systems. Applied Soft Computing 13, 3839–3852.

6. Mahadevan, K., and Kannan, P.S. (2010). Comprehensive learning particle swarm optimi- zation for reactive power dispatch. Applied Soft Computing 10, 641–652.

Références

Documents relatifs

The control objective is twofold: (i) tracking the maximum available wind power; (ii) regulating the DFIG reactive power. The rotor speed, aerodynamic torque and

A Novel Distributed Particle Swarm Optimization Algorithm for the Optimal Power Flow ProblemN. Nicolo Gionfra, Guillaume Sandou, Houria Siguerdidjane, Philippe Loevenbruck,

Another possible research direction is to compare the proposed decentralized optimization scheme with other types of coordination, such as multi- agent model predictive control

The update steps of this algorithm inherits the principle of ADMM (i.e., alternating between the resolution of a primal and dual convex optimization problems), but at each

In [14], a decentralized scheme is proposed, where the different TSOs concurrently schedule reactive power dispatch within their own control area while rep- resenting the

The challenges of these computations are related to: (i) the size of our 8387-bus system, which models a large part of Europe, is roughly three times larger than previously

This rounding heuristic consists in fixing to 1 all binary variables greater or equal to 0.5 (the k great- est ones if there are more than k for the ROPF problem with

It was shown that the state estimation problem can be solved using a convex relaxation based on semi-definite programming.. In the present paper, we propose a fast algorithm for