z-logo
open-access-imgOpen Access
An efficient NSCE algorithm for multi-objective reactive power system compensation with UPFC
Author(s) -
Messaoud Belazzoug,
Abdallah Chanane,
Karim Sebaa
Publication year - 2021
Publication title -
indonesian journal of electrical engineering and computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.241
H-Index - 17
eISSN - 2502-4760
pISSN - 2502-4752
DOI - 10.11591/ijeecs.v22.i2.pp648-659
Subject(s) - unified power flow controller , ac power , tap changer , sorting , genetic algorithm , flexible ac transmission system , control theory (sociology) , transformer , voltage , engineering , electric power system , transmission system , computer science , power flow , algorithm , mathematical optimization , power (physics) , transmission (telecommunications) , mathematics , electrical engineering , control (management) , physics , quantum mechanics , artificial intelligence
This paper proposes a novel approach based on the NSCE (elitist non dominated sorting cross entropy), for the optimization of the location and the size of a flexible AC transmission system device (FACTS) namely: unified power flow controller (UPFC) to achieve the optimal reactive power flow (ORPF). In the present work, the main objective is to minimize the real power losses, the cost investment of several UPFC and the deviation voltages using intelligent algorithms. The proposed study is multiobjective, in which, the power generator buses, the control voltages, the ratio tap changer of transformers and the reactive power injections from installed UPFC are considered as control variables. The proposed NSCE algorithm is validated on IEEE 30-bus test system. A comparison with elitist non dominated sorting genetic algorithm (NSGA-II) and a regularity model-based multiobjective estimation of distribution algorithm (RM-MEDA) is done and completed with hybridization of them.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here