Jianchang Liu

Dr. Jianchang Liu


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 July 2019 in Applied Soft Computing
Verified
Journal Article
Closed access
YYYongkuan Yang
Yongkuan Yang
JLJianchang Liu
Jianchang Liu
STShubin Tan
Shubin Tan
HWHonghai Wang
Honghai Wang

12 August 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
YLYuanchao Liu
Yuanchao Liu
JLJianchang Liu
Jianchang Liu
YJYaochu Jin
Yaochu Jin
Surrogate-assisted evolutionary algorithms (SAEAs) are well suited for computationally expensive optimization. However, most existing SAEAs only focus on low- or medium-dimensional expensive optimization. Thus, a novel SAEA for high-dimensional expensive optimization, denoted as surrogate-assisted multipopulation particle swarm optimizer (SA-MPSO), is proposed and fully investigated in this work. The proposed algorithm employs a parameter-free clustering technique, denoted as affinity propagation clustering, to generate several subswarms. A surrogate-assisted learning strategy-based particle swarm optimizer is proposed for guiding the search of each subswarm. Furthermore, a model management strategy is adapted to choose the promising particles for real fitness evaluations. Finally, a subswarm diversity maintenance scheme and a surrogate-based trust region local search technique are introduced to enhance both exploration and exploitation. The experimental results on commonly used benchmark test problems with dimensions varying from 30 to 100 and airfoil design problem have shown that SA-MPSO outperforms some state-of-the-art methods.

1 April 2020 in Applied Soft Computing
Verified
Journal Article
Closed access
YYYongkuan Yang
Yongkuan Yang
JLJianchang Liu
Jianchang Liu
STShubin Tan
Shubin Tan

15 January 2024 in Applied Soft Computing
Verified
Journal Article
Closed access
DFDa Feng
Da Feng
YLYan Li
Yan Li
JLJianchang Liu
Jianchang Liu
YLYuanchao Liu
Yuanchao Liu

8 February 2023 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
YLYuanchao Liu
Yuanchao Liu
JLJianchang Liu
Jianchang Liu
YJYaochu Jin
Yaochu Jin
FLFei Li
Fei Li
TZTianzi Zheng
Tianzi Zheng
Surrogate-assisted evolutionary algorithms (SAEAs) have been successfully employed for expensive optimization. However, most SAEAs are designed for expensive unconstrained optimization, and less attention has been paid to expensive optimization with inequality constraints. Therefore, this work proposes a novel SAEA, called surrogate-assisted two-stage differential evolution (SA-TSDE), for expensive constrained optimization. In the first search stage, surrogate-assisted hybrid differential evolution is adopted for prescreening promising solutions in the decision space for exploration. Moreover, an effective repair strategy, named surrogate based repair strategy, is introduced to move the infeasible solutions closer to the feasible region. In the second search stage, a clustering strategy of feasible solutions is proposed based on the information provided by the first search stage and historical search. The clustering strategy adaptively generates a number of clusters, each of which can form a promising local region for the local search. Afterwards, local surrogates are built for finding the predicted optima in each local region. During the search process, a good balance between exploration and exploitation can be obtained by interleaving the two search stages. Experimental results indicate that SA-TSDE is highly competitive compared with some state-of-the-art methods.

30 March 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
JLJianchang Liu
Jianchang Liu
YLYuanchao Liu
Yuanchao Liu
YJYaochu Jin
Yaochu Jin
FLFei Li
Fei Li
Dominance robustness (DR) has been proposed for assessing the ability of the Pareto-optimal solutions to remain to be nondominated when the decision variables are subject to noise. There are two main challenges in search for dominance robust optimal solutions in dominance robust multiobjective optimization (MOP), namely, accurate estimation of the DR measure and a good balance between convergence and DR in the presence of uncertainty. In this article, a novel robust MOP evolutionary algorithm based on decision variable assortment (DVA) is proposed to tackle these challenges. To be specific, an indicator, termed as dominance robust indicator, is proposed to measure the DR based on the dominance level and dominance relationship of the sampled points. Then, the decision variables are divided into low DR-related variables and high DR-related variables based on the DVA strategy. Finally, low and high DR related variables are optimized separately to obtain the dominance robust optimal solutions. In addition, performance indicators to quantify the performance of dominance robust optimal solution set obtained by robust MOP algorithm are proposed. Experimental results have demonstrated that the proposed algorithm is competitive in search for dominance robust optimal solutions.