Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/3861Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Venkaiah, Chintham | - |
| dc.contributor.author | Jain, Rohan Vinodkumar | - |
| dc.date.accessioned | 2026-01-27T09:50:48Z | - |
| dc.date.available | 2026-01-27T09:50:48Z | - |
| dc.date.issued | 2017 | - |
| dc.identifier.citation | 10.1109/APPEEC.2017.8308965 | en_US |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/3861 | - |
| dc.description | NITW | en_US |
| dc.description.abstract | In this paper, Multi-Objective Decision Making (MODM) algorithm viz. Multi-Objective JAYA (MOJAYA) al gorithm has been applied for the first time to optimally locate the Distributed Generations (DG) and to choose the optimal size of DGs in a Radial Distribution System (RDS) for achieving the multiple objectives of reducing power loss, improving voltage profile and stability. In order to maximize the DG owners profits and simultaneously achieve the above cited multiple objectives, Multi-Attributes Decision Making (MADM) methods such as Analytic Hierarchy Process (AHP), and Technique for Order of Preference by Similarity to Ideal Solutions (TOPSIS) have been utilized. The proposed MOJAYA algorithm has been applied on IEEE 33 bus RDS and the results thus obtained has resulted in maximizing the profits to the DG owners and achieved the multiple objectives of reducing power loss, improving voltage profile and improving voltage stability of the RDS. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Asia-Pacific Power and Energy Engineering Conference, APPEEC | en_US |
| dc.subject | DG owners cost | en_US |
| dc.subject | Distribution Company (DISCO) cost | en_US |
| dc.title | Multi-objective JAYA algorithm based optimal location and sizing of distributed generation in a radial distribution system | en_US |
| dc.type | Other | en_US |
| Appears in Collections: | Electrical Engineering | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.