Songbai Liu

Songbai Liu

Auto-generated profile, based on publicly available information

Songbai Liu

Shenzhen University

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
14 December 2016 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
QLQiuzhen Lin
Qiuzhen Lin
SLSongbai Liu
Songbai Liu
QZQingling Zhu
Qingling Zhu
CTChaoyu Tang
Chaoyu Tang
RSRuizhen Song
Ruizhen Song
JZJun Zhang
Jun Zhang
Recently, it was found that most multiobjective particle swarm optimizers (MOPSOs) perform poorly when tackling many-objective optimization problems (MaOPs). This is mainly because the loss of selection pressure that occurs when updating the swarm. The number of nondominated individuals is substantially increased and the diversity maintenance mechanisms in MOPSOs always guide the particles to explore sparse regions of the search space. This behavior results in the final solutions being distributed loosely in objective space, but far away from the true Pareto-optimal front. To avoid the above scenario, this paper presents a balanceable fitness estimation method and a novel velocity update equation, to compose a novel MOPSO (NMPSO), which is shown to be more effective to tackle MaOPs. Moreover, an evolutionary search is further run on the external archive in order to provide another search pattern for evolution. The DTLZ and WFG test suites with 4-10 objectives are used to assess the performance of NMPSO. Our experiments indicate that NMPSO has superior performance over four current MOPSOs, and over four competitive multiobjective evolutionary algorithms (SPEA2-SDE, NSGA-III, MOEA/DD, and SRA), when solving most of the test problems adopted.

1 March 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
SLSongbai Liu
Songbai Liu
JLJun Li
Jun Li
QLQiuzhen Lin
Qiuzhen Lin
Ye TianYe Tian
Ye Tian
KTKay Chen Tan
Kay Chen Tan
Most existing evolutionary search strategies are not so efficient when directly handling the decision space of large-scale multiobjective optimization problems (LMOPs). To enhance the efficiency of tackling LMOPs, this paper proposes an accel-erated evolutionary search (AES) strategy. Its main idea is to learn a gradient-descent-like direction vector for each solution via the specially trained feedforward neural network, which may be the learnt possibly fastest convergent direction to reproduce new solutions efficiently. To be specific, a multilayer perceptron with only one hidden layer is constructed, in which the number of neurons in the input and output layers is equal to the dimension of the decision space. Then, to get appropriate training data for the model, the current population is divided into two subsets based on the non-dominated sorting, and each poor solution in one subset with worse convergence will be paired to an elitist solution in another subset with the minimum angle to it, which is considered most likely to guide it with rapid convergence. Next, this multilayer perceptron is updated via backpropagation with gradient descent by using the above elaborately prepared da-taset. At last, an accelerated large-scale multiobjective evolu-tionary algorithm is designed by using AES as reproduction operator. Experimental studies validate the effectiveness of the proposed AES when handling the search space of LMOPs with dimensionality ranging from 1000 to 10000. When compared with six state-of-the-art evolutionary algorithms, the experi-mental results also show the better efficiency and performance of the proposed optimizer in solving various LMOPs.

28 February 2023 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
SLSongbai Liu
Songbai Liu
QLQiuzhen Lin
Qiuzhen Lin
JLJianqiang Li
Jianqiang Li
KTKay Chen Tan
Kay Chen Tan
Recent decades have witnessed great advancements in multiobjective evolutionary algorithms (MOEAs) for multiobjective optimization problems (MOPs). However, these progressively improved MOEAs have not necessarily been equipped with scalable and learnable problem-solving strategies for new and grand challenges brought by the scaling-up MOPs with continuously increasing complexity from diverse aspects, mainly including expensive cost of function evaluations, many objectives, large-scale search space, time-varying environments, and multi-task. Under different scenarios, divergent thinking is required in designing new powerful MOEAs for solving them effectively. In this context, research studies on learnable MOEAs with machine learning techniques have received extensive attention in the field of evolutionary computation. This paper begins with a general taxonomy of scaling-up MOPs and learnable MOEAs, followed by an analysis of the challenges that these MOPs pose to traditional MOEAs. Then, we synthetically overview recent advances of learnable MOEAs in solving various scaling-up MOPs, focusing primarily on four attractive directions (i.e., learnable evolutionary discriminators for environmental selection, learnable evolutionary generators for reproduction, learnable evolutionary evaluators for function evaluations, and learnable evolutionary transfer modules for sharing or reusing optimization experience). The insight of learnable MOEAs is offered to readers as a reference to the general track of the efforts in this field.

23 August 2018 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
QLQiuzhen Lin
Qiuzhen Lin
SLSongbai Liu
Songbai Liu
Ka-Chun WongKa-Chun Wong
Ka-Chun Wong
Maoguo GongMaoguo Gong
Maoguo Gong
Carlos CoelloCarlos Coello
Carlos Coello
JZJun Zhang
Jun Zhang
This paper suggests a novel clustering-based evolutionary algorithm for many-objective optimization problems. Its main idea is to classify the population into a number of clusters, which is expected to solve the difficulty of balancing convergence and diversity in high dimensional objective space. The individuals showing high similarities on the vector angles are gathered into the same cluster, such that the population’s distribution can be well portrayed by the clusters. To efficiently find these clusters, partitional clustering is first used to classify the union population into m main clusters based on the m axis vectors (m is the number of objectives), and then hierarchical clustering is further run on these m main clusters to get N final clusters (N is the population size and N > m). At last, in environmental selection, one individual from each of N clusters closest to the axis vectors is selected to maintain diversity, while one individual from each of the other clusters is preferred by a simple convergence indicator to ensure convergence. When tackling some well-known test problems with 5 to 15 objectives, extensive experiments validate the superiority of our algorithm over six competitive many-objective evolutionary algorithms, especially on problems with incomplete and irregular Pareto-optimal fronts.

13 December 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
SLSongbai Liu
Songbai Liu
QLQiuzhen Lin
Qiuzhen Lin
QLQing Li
Qing Li
KTKay Chen Tan
Kay Chen Tan
Competitive swarm optimizers (CSOs) have shown very promising search efficiency in large-scale decision space. However, they face difficulties when solving large-scale multi-/many-objective optimization problems (LMOPs), as their winner particles are selected by random pairwise competition based on only a single evaluation criterion, which does not provide diverse guidance for LMOPs. To alleviate this issue, this article proposes a comprehensive competitive learning (CCL) strategy for CSOs using three competition mechanisms to guide the particle search. Specifically, environmental competition classifies winner and loser particles from the swarm, while cognitive competition and social competition select one winner particle as the cognitive component and the social component, respectively, to guide the search for loser particles. This competitive learning strategy aims to enhance the search capability of loser particles and provides diverse search directions for solving LMOPs. When compared with eight competitive optimizers, the experimental results validate the high efficiency and effectiveness of our method in solving nine LMOPs with 2–10 objectives and 100–5000 variables.

18 August 2021 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
SLSongbai Liu
Songbai Liu
QLQiuzhen Lin
Qiuzhen Lin
Ye TianYe Tian
Ye Tian
KTKay Chen Tan
Kay Chen Tan
Large-scale multiobjective optimization problems (LMOPs) bring significant challenges for traditional evolutionary operators, as their search capability cannot efficiently handle the huge decision space. Some newly designed search methods for LMOPs usually classify all variables into different groups and then optimize the variables in the same group with the same manner, which can speed up the population’s convergence. Following this research direction, this article suggests a differential evolution (DE) algorithm that favors searching the variables with higher importance to the solving of LMOPs. The importance of each variable to the target LMOP is quantized and then all variables are categorized into different groups based on their importance. The variable groups with higher importance are allocated with more computational resources using DE. In this way, the proposed method can efficiently generate offspring in a low-dimensional search subspace formed by more important variables, which can significantly speed up the convergence. During the evolutionary process, this search subspace for DE will be expanded gradually, which can strike a good balance between exploration and exploitation in tackling LMOPs. Finally, the experiments validate that our proposed algorithm can perform better than several state-of-the-art evolutionary algorithms for solving various benchmark LMOPs.