Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/6661
Title: Loss minimization and load-ability improvement in distributed power system using mixed-integer flower pollination optimization algorithm [articol]
Authors: Ponnusamy, Arul
Subjects: Distribution generation
Placement
Reconfiguration
Mixed-integer flower pollination algorithm
Optimal location
Optimal sizing
Issue Date: 2020
Publisher: Timișoara : Editura Politehnica
Citation: Ponnusamy, Arul. Loss minimization and load-ability improvement in distributed power system using mixed-integer flower pollination optimization algorithm. Timişoara: Editura Politehnica, 2020.
Series/Report no.: Journal of Electrical Engineering;Vol 20 No 1
Abstract: The increasing need for electricity shows the importance of electricity generation on the distribution side. The transmission loss reduction also becomes as one of the key issues to be resolved. The location of Distributed Generators (DG) and size of DG has to be identified, as the power system has many buses. So optimal allocation and sizing of DG is required. The distribution system is reconfigured with new tie switches, which improves the voltage profile and minimizes the loss. In this paper, the loss minimization and system load-ability improvement are used as multi-objective. The 25 % weight is given for loss and 75 % is given for load-ability. And a new mixed integer flower pollination algorithm is used here for solving this multi-objective function. Here the DGs considered are the synchronous inverter. So, it supplies both real as well as reactive power. The power factor can be optimally chosen from the algorithm. Here the test system of IEEE 33-bus distribution system is used. And the results are compared with previous technique.
URI: https://dspace.upt.ro/xmlui/handle/123456789/6661
ISSN: 1582-4594
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Ponnusamy_f.pdf503.7 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.