Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering
Duong, Thanh Long
Unknown Affiliation
Computer Science & IT Electrical & Electronics Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Optimal placement of battery energy storage system considering penetration of distributed generations Nguyen, Thuan Thanh; Nguyen, Hoai Phong; Duong, Thanh Long
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp6068-6078

Abstract

This paper proposes the optimal problem of location and power of the battery-energy-storage-system (BESS) on the distribution system (DS) considering different penetration levels of distributed generations (DGs). The objective is to minimize electricity cost of the DS in a typical day considering the power limit of DG fed to the DS. Growth optimizer (GO) is first applied to search the BESS’s location and power for each interval of the day. The considered problem and GO method are evaluated on the 18-node DS with two penetrations levels of photovoltaic system and wind turbine. The results demonstrate that the optimal BESS placement significantly reduces electricity cost. Furthermore, the optimal BESS location and power also help to reduce the cut capacity of DGs as their power greater than the load demand. The compared results between GO and particle swarm optimization (PSO) method have shown that GO reaches the better performance than PSO in term the optimal solution and the statistical results. Thus, GO is an effective approach for the BESS placement problem.
Modified differential evolution algorithm to finding optimal solution for AC transmission expansion planning problem Duong, Thanh Long; Bui, Nguyen Duc Huy
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5045-5054

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.
Co-Authors Bui, Nguyen Duc Huy Nguyen, Hoai Phong Nguyen, Thuan Thanh