Modified differential evolution algorithm to finding optimal solution for AC transmission expansion planning problem.
Saved in:
| Title: | Modified differential evolution algorithm to finding optimal solution for AC transmission expansion planning problem. |
|---|---|
| Authors: | Duong, Thanh Long1 duongthanhlong@iuh.edu.vn, Bui, Nguyen Duc Huy1 bui2huy@gmail.com |
| Source: | International Journal of Electrical & Computer Engineering (2088-8708). Dec2025, Vol. 15 Issue 6, p5045-5054. 10p. |
| Subjects: | Differential evolution, Alternating currents, Electric power system planning, Nonlinear equations, Mathematical optimization, Algorithms, Electric power consumption, Capital costs |
| Abstract: | The transmission expansion planning (TEP) problem primarily aims to determine the appropriate number and location of additional lines required to meet the increasing power demand at the lowest possible investment cost while meeting the operation constraints. Most of the research in the past solved the TEP problem using the direct current (DC) model instead of the alternating current (AC) model because of its non-linear and non-convex nature. In order to improve the effectiveness of solving the AC transmission expansion planning (ACTEP) problem, a modified version of the differential evolution (DE) is proposed in this paper. The main idea of the modification is to limit the randomness of the mutation process by focusing on the first, second, and third-best individuals. To prove the effectiveness of the suggested method, the ACTEP problem considering fuel costs is solved in the Graver 6 bus system and the IEEE 24 bus system. Moreover, the result of each system is compared to the original DE algorithm and state-of-the-art methods such as the one-to-one-based optimizer (OOBO), the artificial hummingbird algorithm (AHA), the dandelion optimizer (DO), the tuna swarm optimization (TSO), and the chaos game optimization (CGO). The results show that the proposed algorithm is more effective than the original DE algorithm by 1.86% in solving the ACTEP problem. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Electrical & Computer Engineering (2088-8708) is the property of Institute of Advanced Engineering & Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 190950245 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Modified differential evolution algorithm to finding optimal solution for AC transmission expansion planning problem. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Duong%2C+Thanh+Long%22">Duong, Thanh Long</searchLink><relatesTo>1</relatesTo><i> duongthanhlong@iuh.edu.vn</i><br /><searchLink fieldCode="AR" term="%22Bui%2C+Nguyen+Duc+Huy%22">Bui, Nguyen Duc Huy</searchLink><relatesTo>1</relatesTo><i> bui2huy@gmail.com</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Electrical+%26+Computer+Engineering+%282088-8708%29%22">International Journal of Electrical & Computer Engineering (2088-8708)</searchLink>. Dec2025, Vol. 15 Issue 6, p5045-5054. 10p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Differential+evolution%22">Differential evolution</searchLink><br /><searchLink fieldCode="DE" term="%22Alternating+currents%22">Alternating currents</searchLink><br /><searchLink fieldCode="DE" term="%22Electric+power+system+planning%22">Electric power system planning</searchLink><br /><searchLink fieldCode="DE" term="%22Nonlinear+equations%22">Nonlinear equations</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Electric+power+consumption%22">Electric power consumption</searchLink><br /><searchLink fieldCode="DE" term="%22Capital+costs%22">Capital costs</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: The transmission expansion planning (TEP) problem primarily aims to determine the appropriate number and location of additional lines required to meet the increasing power demand at the lowest possible investment cost while meeting the operation constraints. Most of the research in the past solved the TEP problem using the direct current (DC) model instead of the alternating current (AC) model because of its non-linear and non-convex nature. In order to improve the effectiveness of solving the AC transmission expansion planning (ACTEP) problem, a modified version of the differential evolution (DE) is proposed in this paper. The main idea of the modification is to limit the randomness of the mutation process by focusing on the first, second, and third-best individuals. To prove the effectiveness of the suggested method, the ACTEP problem considering fuel costs is solved in the Graver 6 bus system and the IEEE 24 bus system. Moreover, the result of each system is compared to the original DE algorithm and state-of-the-art methods such as the one-to-one-based optimizer (OOBO), the artificial hummingbird algorithm (AHA), the dandelion optimizer (DO), the tuna swarm optimization (TSO), and the chaos game optimization (CGO). The results show that the proposed algorithm is more effective than the original DE algorithm by 1.86% in solving the ACTEP problem. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Electrical & Computer Engineering (2088-8708) is the property of Institute of Advanced Engineering & Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=190950245 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.11591/ijece.v15i6.pp5045-5054 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 10 StartPage: 5045 Subjects: – SubjectFull: Differential evolution Type: general – SubjectFull: Alternating currents Type: general – SubjectFull: Electric power system planning Type: general – SubjectFull: Nonlinear equations Type: general – SubjectFull: Mathematical optimization Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Electric power consumption Type: general – SubjectFull: Capital costs Type: general Titles: – TitleFull: Modified differential evolution algorithm to finding optimal solution for AC transmission expansion planning problem. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Duong, Thanh Long – PersonEntity: Name: NameFull: Bui, Nguyen Duc Huy IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 12 Text: Dec2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 20888708 Numbering: – Type: volume Value: 15 – Type: issue Value: 6 Titles: – TitleFull: International Journal of Electrical & Computer Engineering (2088-8708) Type: main |
| ResultId | 1 |
