An Chen

An Chen

Auto-generated profile, based on publicly available information

An Chen

Xi An Jiao Tong Univ, Sch Automat Sci & Engn, Xian, Peoples R China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
27 April 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
ACAn Chen
An Chen
ZRZhigang Ren
Zhigang Ren
WGWenhua Guo
Wenhua Guo
YLYongsheng Liang
Yongsheng Liang
ZFZu-Ren Feng
Zu-Ren Feng
Decomposition plays a significant role in cooperative coevolution, which shows great potential in large-scale black-box optimization (LSBO). However, current learning-based decomposition algorithms require many fitness evaluations (FEs) to detect variable interdependencies and encounter the difficulty of threshold setting. To address these issues, this study proposes an efficient adaptive differential grouping (EADG) algorithm. Instead of homogeneously tackling different types of LSBO instances, EADG first identifies the instance type by detecting the interdependencies of a few pairs of variable subsets. Only if the instance is partially separable dose EADG further engage with it by converting its decomposition process into a search process in a binary tree. This facilitates the systematic reutilization of evaluated solutions so that half the interdependencies can be directly deduced without extra FEs. To promote the decomposition accuracy, EADG specially designs a normalized interdependency indicator that can adaptively generate a decomposition threshold according to its ordinal distribution. Theoretical analysis and experimental results show that EADG outperforms current popular decomposition algorithms. Further tests indicate that it can help cooperative coevolution achieve highly competitive optimization performance.

27 February 2020 in IEEE Access
Verified
Journal Article
Open access
ZRZhigang Ren
Zhigang Ren
ACAn Chen
An Chen
MWMuyi Wang
Muyi Wang
Yang YangYang Yang
Yang Yang
YLYongsheng Liang
Yongsheng Liang
KSKe Shang
Ke Shang
Taking “divide-and-conquer” as a basic idea, cooperative coevolution (CC) has shown a promising prospect in large scale global optimization. However, its high requirement on the decomposition accuracy can hardly be satisfied in practice. Directing against this issue, this study proposes a bi-hierarchical cooperative coevolution (BHCC), which can tolerate a certain degree of decomposition error. Besides the cooperation among sub-problems as in the conventional CC, BHCC introduces a kind of cooperation between sub-problems and the overall problem. By systematically exploiting the excellent sub-solutions obtained during the sub-space optimization process, it initializes the population for the optimization process on the overall problem and thus can conduct search in promising regions of the whole solution space. The newly acquired complete solutions are in turn employed to update the context vector and the population of each sub-problem, where the context vector is used for sub-solution evaluation. Consequently, the search direction misdirected by an improper decomposition can be corrected to a great extent. To keep the balance between the two types of optimization processes, an adaptive triggering mechanism for the overall optimization process is specially designed for BHCC. Experimental results on two widely-used benchmark suites verify the effectiveness of the new strategies in BHCC and also indicate that BHCC is more robust than existing CCs and can achieve competitive performance compared with several state-of-the-art algorithms.

30 November 2022 in Information Sciences
Verified
Journal Article
Closed access
ACAn Chen
An Chen
ZRZhigang Ren
Zhigang Ren
MWMuyi Wang
Muyi Wang
YLYongsheng Liang
Yongsheng Liang
HLHanqing Liu
Hanqing Liu
WDWenhao Du
Wenhao Du

1 July 2020
Verified
Conference Paper
Closed access
DGDaofu Guo
Daofu Guo
ZRZhigang Ren
Zhigang Ren
YLYongsheng Liang
Yongsheng Liang
ACAn Chen
An Chen
Surrogate model assisted evolutionary algorithms (SAEAs) have attracted much research attention in solving computationally expensive optimization problems. They show excellent performance on low-dimensional optimization problems by saving a large number of real fitness evaluations, but generally fail on high-dimensional problems due to the contradiction between the huge solution space and the limited computational resources. To alleviate this issue, this study attempts to scale up radial basis function (RBF), which is a kind of widely used surrogate model, by taking advantage of the random projection (RP) technique, and thus develops a RP-based RBF (RP-RBF). Different from existing methods that directly train RBF in the original solution space, RP-RBF first randomly projects the original high-dimensional solution space onto many low-dimensional subspaces, and then trains an RBF in each subspace. The resulting low-dimensional RBFs are finally used together to approximate the fitness values of new candidate solutions. The introduction of RP greatly reduces the number of training samples required by RBF on the one hand, and helps RBF still capture the main characteristics of the original problems on the other hand. To verify the effectiveness of RP-RBF, this study integrates it with a differential evolution (DE) and develops a novel SAEA named RP-RBF-DE. Experimental results on a set of 12 benchmark functions demonstrate that RP-RBF significantly improves the accuracy of the traditional RBF and RP-RBF-DE outperforms the traditional DE and a general RBF-assisted DE.