Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Cuckoo Search Algorithm for Congestion Alleviation with Incorporation of Wind Farm

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 8 No. 6 (2018)

DOI
10.11591/ijece.v8i6.pp4871-4879
ISSN
2088-8708, 2088-8708
Terbit
2018-12-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-nc/4.0

Abstrak

The issue to alleviate congestion in the power system framework has emerged as an alluring field for the power system researchers. The research conducted in this article proposes a cuckoo search algorithm based congestion alleviation strategy with the incorporation of wind farm. The bus sensitivity factor data are computed and utilized to sort out the sutiable position for the installation of the wind farm. The generators contributing in the real power rescheduleing process are selected as per the generator sensitivity values. The cuckoo search algorithm is implemented to minimize the congestion cost with the embodiment of the wind farm.The proposed method is tested on 39 bus New England framework and the results obtained with the cuckoo search based congestion management approach outperforms the results opted with other heuristic optimization techniques in the past research literatures.

Jaringan kolaborasi para penulis

3 penulis · 2 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • National Institute of Technology Jamshedpur
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
DSNM RaoAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Data ini berasal dari Crossref (yang disetorkan penerbit), karena endpoint OAI-PMH milik jurnal tidak dapat di-harvest.

Sumber metadata: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, pertama di-harvest 27 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata sebagai oai_dc, dikonversi dari Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Cuckoo Search Algorithm for Congestion Alleviation with Incorporation of Wind Farm</dc:title><dc:creator>Paul, Kaushik</dc:creator><dc:creator>Kumar, Niranjan</dc:creator><dc:description>&lt;jats:p&gt;The issue to alleviate congestion in the power system framework has emerged as an alluring field for the power system researchers. The research conducted in this article proposes a cuckoo search algorithm based congestion alleviation strategy with the incorporation of wind farm. The bus sensitivity factor data are computed and utilized to sort out the sutiable position for the installation of the wind farm. The generators contributing in the real power rescheduleing process are selected as per the generator sensitivity values. The cuckoo search algorithm is implemented to minimize the congestion cost with the embodiment of the wind farm.The proposed method is tested on 39 bus New England framework and the results obtained with the cuckoo search based congestion management approach outperforms the results opted with other heuristic optimization techniques in the past research literatures.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2018-12-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v8i6.pp4871-4879</dc:identifier><dc:identifier>10.11591/ijece.v8i6.pp4871-4879</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 8 No 6 (2018); 4871</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/12373/11245</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>