Aokang Pang

Mr. Aokang Pang


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 January 2023 in Energies
Verified
Journal Article
Open access
PDF file
APAokang Pang
Aokang Pang
HLHuijun Liang
Huijun Liang
CLChenhao Lin
Chenhao Lin
LYLei Yao
Lei Yao
Large-scale grids have gradually become the dominant trend in power systems, which has increased the importance of solving the challenges associated with large-scale economic dispatch (LED). An increase in the number of decision variables enlarges the search-space scale in LED. In addition to increasing the difficulty of solving algorithms, huge amounts of computing resources are consumed. To overcome this problem, we proposed a surrogate-assisted adaptive bat algorithm (GARCBA). On the one hand, to reduce the execution time of LED problems, we proposed a generalized regression neural network surrogate model based on a self-adaptive “minimizing the predictor” sampling strategy, which replaces the original fuel cost functions with a shorter computing time. On the other hand, we also proposed an improved hybrid bat algorithm (RCBA) named GARCBA to execute LED optimization problems. Specifically, we developed an evolutionary state evaluation (ESE) method to increase the performance of the original RCBA. Moreover, we introduced the ESE to analyze the population distribution, fitness, and effective radius of the random black hole in the original RCBA. We achieved a substantial improvement in computational time, accuracy, and convergence when using the GARCBA to solve LED problems, and we demonstrated this method’s effectiveness with three sets of simulations.

27 February 2023 in Applied Energy
Verified
Journal Article
Closed access
CLChenhao Lin
Chenhao Lin
HLHuijun Liang
Huijun Liang
APAokang Pang
Aokang Pang


22 January 2024 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
APAokang Pang
Aokang Pang
HLHuijun Liang
Huijun Liang
CLChenhao Lin
Chenhao Lin
LYLei Yao
Lei Yao

1 January 2024 in International Journal of Swarm Intelligence Research
Verified
Journal Article
Open access
PDF file
HLHuijun Liang
Huijun Liang
APAokang Pang
Aokang Pang
CLChenhao Lin
Chenhao Lin
JZJianwei Zhong
Jianwei Zhong
In this article, a novel hybrid binary bat algorithm named HBBA is proposed for global optimization problems. First, to avoid simultaneous updating of bat velocity's dimensional components, i.e., elements of velocity vector, a random black hole model is modified to adapt to binary algorithm for updating in unknown spaces for each dimensional component individually. Through this way, the search ability of bats around the current group best is increased greatly. Second, a time-varying v-shaped transfer function, rather than a time-invariant one as in closely related works, is proposed to map velocity in continuous search space to a binary one. This accelerates the speed to switch individuals' positions, i.e., solutions in binary space. Third, a chaotic map is utilized to replace monotonous parameters in original binary bat algorithm, which is beneficial for avoiding premature convergence. Simulation results demonstrate the effectiveness of the proposed algorithm by three types of benchmark functions and unit commitment problem.

28 August 2024 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
HLHuijun Liang
Huijun Liang
CLChenhao Lin
Chenhao Lin
APAokang Pang
Aokang Pang
Due to long optimization time and limited dispatching cycle, multi-area combined economic/emission dispatch (MACEED) problems are converted into computationally expensive MACEED (CEMACEED) problems. Existing centralized and distributed method for CEMACEED problems include time-consuming and inaccurate disadvantages. The drawbacks, i.e., low convergence rate and unaffordable computing time may make scheduling cycles can hardly be met. In this paper, a novel surrogate-based bi-level programming framework is proposed. CEMACEED problem is decoupled to obtain completely independent sub-area dispatching problems. Then, a novel surrogate-based constraint-handling technique is proposed to handle tie line constraint while realizing decoupling. Original tie line constraint is replaced by improved polynomial regression surrogate models to save more than 75% of operating time. Finally, a novel meta-heuristic algorithm named emotional accumulation game evolutionary algorithm (EAGEA) is proposed to execute CEMACEED problems. The proposed method obtains the minimum cost, emission, and operating time over all simulation cases.