Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/6639
Title: | An elegant solution method for searching optimality in power system [articol] |
Authors: | Sakthi, S. |
Subjects: | Power system Electrical engineering |
Issue Date: | 2020 |
Publisher: | Timișoara : Editura Politehnica |
Citation: | Sakthi, S.; Senthilkumar, V.: An elegant solution method for searching optimality in power system. Timişoara: Editura Politehnica, 2020. |
Series/Report no.: | Journal of Electrical Engineering;Vol 20 No 1 |
Abstract: | Optimal power flows justify the whole operational planning and operation of power system. Optimal control settings as active power generations, Voltages of all generators, optimal setting of transformer and compensators with a view of minimization of one or more objective functions such as fuel cost, losses, etc. It is a constrained optimization problem statement; it can be solved by traditional mathematical techniques. These techniques grieve from the drawback of landing at sub-optimal solution and difficulties in handling non-differentiable and discontinuous functions. The development of Evolutionary algorithms such as GA, PSO, EP, etc. has tried to overcome the drawbacks. Recently, Flower Pollination Algorithm (FPA), a nature-intriguing algorithm works based on the characteristics off lowering plants. Its evolutionary characteristics can be utilized to determine a solution methodology for optimal power flow. This paper extends to develop a Flower Pollination Algorithm based methodology for solving Optimal Power Flow with a view to obtain the global best solution and presents the results on IEEE 30 bus system to display its effectiveness |
URI: | https://dspace.upt.ro/xmlui/handle/123456789/6639 |
ISSN: | 1582-4594 |
Appears in Collections: | Articole științifice/Scientific articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
BUPT_ART_Sakthi_f.pdf | 757.15 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.