Qinghua Su

Qinghua Su

Auto-generated profile, based on publicly available information

Qinghua Su

School of Information and Mathematics, Yangtze University, Jingzhou, China

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
11 February 2020 in IEEE Access
Verified
Journal Article
Open access
CDCanyun Dai
Canyun Dai
ZHZhongbo Hu
Zhongbo Hu
ZLZheng Li
Zheng Li
ZXZenggang Xiong
Zenggang Xiong
QSQinghua Su
Qinghua Su
The grey prediction evolution algorithm based on the even grey model (GPEAe) proposed by Z.B.Hu et al. in 2019 is a competitively stochastic real-parameter optimization algorithm with characters of simple code, less parameters and strong exploration capability. To improve the algorithmic overall performance, a topological opposition-based learning strategy (TOBL) is first developed to enhance its exploitation capability in this paper. The TOBL determines offsprings by calculating the Manhattan distances between the current best individual and all the vertices of the hypercube inspired by the opposition-based learning strategy. An improved grey prediction evolutionary algorithm based on the TOBL (TOGPEAe) is then proposed. The performance of the TOGPEAe is tested on CEC2005, CEC2014 benchmark functions and a test suite composed of six engineering design problems. The experimental results of the TOGPEAe are very competitive compared with those of the original GPEAe and other state-of-the-art algorithms.

21 October 2013 in Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
ZHZhongbo Hu
Zhongbo Hu
SXShengwu Xiong
Shengwu Xiong
QSQinghua Su
Qinghua Su
XZXiaowei Zhang
Xiaowei Zhang
The differential evolution algorithm (DE) is one of the most powerful stochastic real-parameter optimization algorithms. The theoretical studies on DE have gradually attracted the attention of more and more researchers. However, few theoretical researches have been done to deal with the convergence conditions for DE. In this paper, a sufficient condition and a corollary for the convergence of DE to the global optima are derived by using the infinite product. A DE algorithm framework satisfying the convergence conditions is then established. It is also proved that the two common mutation operators satisfy the algorithm framework. Numerical experiments are conducted on two parts. One aims to visualize the process that five convergent DE based on the classical DE algorithms escape from a local optimal set on two low dimensional functions. The other tests the performance of a modified DE algorithm inspired of the convergent algorithm framework on the benchmarks of the CEC2005.

15 July 2013 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
QSQinghua Su
Qinghua Su
ZHZhongbo Hu
Zhongbo Hu
Differential evolution algorithm (DE) is one of the novel stochastic optimization methods. It has a better performance in the problem of the color image quantization, but it is difficult to set the parameters of DE for users. This paper proposes a color image quantization algorithm based on self-adaptive DE. In the proposed algorithm, a self-adaptive mechanic is used to automatically adjust the parameters of DE during the evolution, and a mixed mechanic of DE andK-means is applied to strengthen the local search. The numerical experimental results, on a set of commonly used test images, show that the proposed algorithm is a practicable quantization method and is more competitive thanK-means and particle swarm algorithm (PSO) for the color image quantization.

1 January 2018 in Complexity
Verified
Journal Article
Open access
PDF file
XXXinlin Xu
Xinlin Xu
ZHZhongbo Hu
Zhongbo Hu
QSQinghua Su
Qinghua Su
ZXZenggang Xiong
Zenggang Xiong
The collective decision optimization algorithm (CDOA) is a new stochastic population‐based evolutionary algorithm which simulates the decision behavior of human. In this paper, a multiobjective collective decision optimization algorithm (MOCDOA) is first proposed to solve the environmental/economic dispatch (EED) problem. MOCDOA uses three novel learning strategies, that is, a leader‐updating strategy based on the maximum distance of each solution in an external archive, a wise random perturbation strategy based on the sparse mark around a leader, and a geometric center‐updating strategy based on an extreme point. The proposed three learning strategies benefit the improvement of the uniformity and the diversity of Pareto optimal solutions. Several experiments have been carried out on the IEEE 30‐bus 6‐unit test system and 10‐unit test system to investigate the performance of MOCDOA. In terms of extreme solutions, compromise solution, and three metrics (SP, HV, and CM), MOCDOA is compared with other existing multiobjective optimization algorithms. It is demonstrated that MOCDOA can generate the well‐distributed and the high‐quality Pareto optimal solutions for the EED problem and has the potential to solve the multiobjective optimization problems of other power systems.

21 March 2023 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
WTWangyu Tong
Wangyu Tong
DLDi Liu
Di Liu
ZHZhongbo Hu
Zhongbo Hu
QSQinghua Su
Qinghua Su

28 August 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
WLWen Li
Wen Li
QSQinghua Su
Qinghua Su
ZHZhongbo Hu
Zhongbo Hu