Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Artificial intelligence of optimal real power dispatch with constraints of lines overloading

International Journal of Power Electronics and Drive Systems · Vol. 14 No. 3 (2023) · hlm. 1885–1893

DOI
10.11591/ijpeds.v14.i3.pp1885-1893
ISSN
2722-256X, 2088-8694
Terbit
2023-09-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

In the literature on optimal power flow (OPF), it has been shown that the suggested ways offer a higher degree of satisfaction in optimizing overall production costs while fulfilling power flow equations, system security, and equipment operational constraints. Despite this, the overloaded of the transmission lines are taken as a performance index but not a primary constraint. This article presents an improved approach to artificial intelligence algorithms of optimal real power dispatch with the security of lines; the main difference concerning our point seen relies on the additional penalization of the choices, which does not respect this constraint. The problem is implemented in the IEEE 14-bus system with "5" generator units. The results of the simulations of the metaheuristic algorithms without/with constraint (overloaded lines) were compared. Furthermore, this article suggests hybridizing ant colony optimization (ACO) and genetic algorithm (GA) as a means to enhance the optimization performance of these algorithms. This hybridization involves using ACO to generate a set of initial solutions, which are then refined using GA. The compound results obtained by the ant system-genetic algorithm hybrid (H-ASGA) for the problem of overloaded lines validated its potential.

Kata kunci

Jaringan kolaborasi para penulis

27 penulis · 63 tautan kepenulisan bersama · 17 lintas organisasi

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

  • University of Bechar
  • Ahmed Draia University
  • Abdelmalek Essaâdi University
  • University of Tamanghasset
  • Centre Universitaire Nour Bachir El Bayadh
  • 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
Othmane AbdelkhalekUniversity of Bechar3
Mohammed Amine SoumeurUniversity of Bechar3
Oussama HafsiUniversity of Bechar2
Omar El MalekyAbdelmalek Essaâdi University1
Farid Ben AbdelouahabAbdelmalek Essaâdi University1
Mohammad EssaaidiAfiliasi tidak diketahui1
Khelifa BenahmedUniversity of Bechar1
Boubakeur HamliliUniversity of Bechar1
Imane ChaoufiAfiliasi tidak diketahui1
Mohammed BouzidiUniversity of Tamanghasset1
Faradji BoubakarUniversity of Tamanghasset1
Allali AhmedAfiliasi tidak diketahui1
Toufik ToumiUniversity of Bechar1
Hartani Mohammed AmineAhmed Draia University1
Abdeselem ChakarUniversity of Bechar1
Hamza TédjiniUniversity of Bechar1
Mohamed NourCentre Universitaire Nour Bachir El Bayadh1
Hassane BachiriUniversity of Bechar1
Abdelkader GhezouaniUniversity of Bechar1
Nouria NairUniversity of Bechar1
Chergui HichemAfiliasi tidak diketahui1
Korhan KayisliAfiliasi tidak diketahui1
Asma BenayadAhmed Draia University1
Saïd BentoubaAhmed Draia University1

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.

Sumber metadata: OAI-PMH (metadata jurnal) http://ijpeds.iaescore.com/index.php/IJPEDS/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Artificial intelligence of optimal real power dispatch with constraints of lines overloading</dc:title>
	<dc:creator>Abderrahmani, Abdesselam</dc:creator>
	<dc:creator>Abdelfatah, Nasri</dc:creator>
	<dc:creator>Brahim, Gasbaoui</dc:creator>
	<dc:subject xml:lang="en-US">Algorithm hybrid; Economic dispatch; Meta-heuristics algorithms; Optimal power flow; Security constrained</dc:subject>
	<dc:description xml:lang="en-US">In the literature on optimal power flow (OPF), it has been shown that the suggested ways offer a higher degree of satisfaction in optimizing overall production costs while fulfilling power flow equations, system security, and equipment operational constraints. Despite this, the overloaded of the transmission lines are taken as a performance index but not a primary constraint. This article presents an improved approach to artificial intelligence algorithms of optimal real power dispatch with the security of lines; the main difference concerning our point seen relies on the additional penalization of the choices, which does not respect this constraint. The problem is implemented in the IEEE 14-bus system with "5" generator units. The results of the simulations of the metaheuristic algorithms without/with constraint (overloaded lines) were compared. Furthermore, this article suggests hybridizing ant colony optimization (ACO) and genetic algorithm (GA) as a means to enhance the optimization performance of these algorithms. This hybridization involves using ACO to generate a set of initial solutions, which are then refined using GA. The compound results obtained by the ant system-genetic algorithm hybrid (H-ASGA) for the problem of overloaded lines validated its potential.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2023-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijpeds.iaescore.com/index.php/IJPEDS/article/view/22712</dc:identifier>
	<dc:identifier>10.11591/ijpeds.v14.i3.pp1885-1893</dc:identifier>
	<dc:source xml:lang="en-US">International Journal of Power Electronics and Drive Systems (IJPEDS); Vol 14, No 3: September 2023; 1885-1893</dc:source>
	<dc:source>2722-256X</dc:source>
	<dc:source>2088-8694</dc:source>
	<dc:source>10.11591/ijpeds.v14.i3</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijpeds.iaescore.com/index.php/IJPEDS/article/view/22712/14308</dc:relation>
	<dc:relation>https://ijpeds.iaescore.com/index.php/IJPEDS/article/downloadSuppFile/22712/3168</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Abdesselam Abderrahmani, Nasri Abdelfatah, Gasbaoui Brahim</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>