Sheng Qi

Sheng Qi

Auto-generated profile, based on publicly available information

Sheng Qi

College of Systems Engineering, National University of Defense Technology,Changsha,China,410073

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
27 July 2022 in Information Sciences
Verified
Journal Article
Open access
SQSheng Qi
Sheng Qi
JZJuan Zou
Juan Zou
Shengxiang YangShengxiang Yang
Shengxiang Yang
YJYaochu Jin
Yaochu Jin
JZJinhua Zheng
Jinhua Zheng
XYXu Yang
Xu Yang

27 May 2024 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
SQSheng Qi
Sheng Qi
RWRui Wang
Rui Wang
Tao ZhangTao Zhang
Tao Zhang
XYXu Yang
Xu Yang
RSRuiqing Sun
Ruiqing Sun
LWLing Wang
Ling Wang
Traditional large-scale multi-objective optimization algorithms (LSMOEAs) encounter difficulties when dealing with sparse large-scale multi-objective optimization problems (SLM-OPs) where most decision variables are zero. As a result, many algorithms use a two-layer encoding approach to optimize binary variable Mask and real variable Dec separately. Nevertheless, existing optimizers often focus on locating non-zero variable positions to optimize the binary variables Mask. However, approximating the sparse distribution of real Pareto optimal solutions does not necessarily mean that the objective function is optimized. In data mining, it is common to mine frequent itemsets appearing together in a dataset to reveal the correlation between data. Inspired by this, we propose a novel two-layer encoding learning swarm optimizer based on frequent itemsets (TELSO) to address these SLMOPs. TELSO mined the frequent terms of multiple particles with better target values to find mask combinations that can obtain better objective values for fast convergence. Experimental results on five real-world problems and eight benchmark sets demonstrate that TELSO outperforms existing state-of-the-art sparse large-scale multi-objective evolutionary algorithms (SLMOEAs) in terms of performance and convergence speed.

22 July 2024 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
SQSheng Qi
Sheng Qi
RWRui Wang
Rui Wang
Tao ZhangTao Zhang
Tao Zhang
WHWeixiong Huang
Weixiong Huang
FYFan Yu
Fan Yu
LWLing Wang
Ling Wang
Sparse large-scale multi-objective optimization problems (SLMOPs) are common in science and engineering. However, the large-scale problem represents the high dimensionality of the decision space, requiring algorithms to traverse vast expanse with limited computational resources. Furthermore, in the context of sparse, most variables in Pareto optimal solutions are zero, making it difficult for algorithms to identify non-zero variables efficiently. This paper is dedicated to addressing the challenges posed by SLMOPs. To start, we introduce innovative objective functions customized to mine maximum and minimum candidate sets. This substantial enhancement dramatically improves the efficacy of frequent pattern mining. In this way, selecting candidate sets is no longer based on the quantity of non-zero variables they contain but on a higher proportion of non-zero variables within specific dimensions. Additionally, we unveil a novel approach to association rule mining, which delves into the intricate relationships between non-zero variables. This novel methodology aids in identifying sparse distributions that can potentially expedite reductions in the objective function value. We extensively tested our algorithm across eight benchmark problems and four real-world SLMOPs. The results demonstrate that our approach achieves competitive solutions across various challenges.

26 May 2022 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
SQSheng Qi
Sheng Qi
JZJuan Zou
Juan Zou
Shengxiang YangShengxiang Yang
Shengxiang Yang
JZJinhua Zheng
Jinhua Zheng

2 June 2023 in Information Sciences
Verified
Journal Article
Closed access
SQSheng Qi
Sheng Qi
RWRui Wang
Rui Wang
Tao ZhangTao Zhang
Tao Zhang
NDNanjiang Dong
Nanjiang Dong

31 December 2025 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
WHWeixiong Huang
Weixiong Huang
RWRui Wang
Rui Wang
Tao ZhangTao Zhang
Tao Zhang
SQSheng Qi
Sheng Qi
LWLing Wang
Ling Wang
Solving constrained multiobjective optimization problems (CMOPs) is a highly challenging work. Numerous complex nonlinear constraints significantly add to the complexity of CMOPs, resulting in an exceptionally intricate feasible region. Makes it difficult for the algorithm to search for the complete constraint PF. In addition, under the influence of multiple complex nonlinear constraints, the conventional calculation method of overall constraint violation is inefficient for assessing the quality of infeasible solutions, potentially misguiding the evolutionary direction of the population. In response to these challenges, this paper proposes the fuzzy constraint dominance strategy (FCDS). This novel approach facilitates nuanced comparisons of solutions to strike a better balance between objectives and constraints. The fuzzy constraint violation introduced in FCDS mitigates the misleading impact of complex nonlinear constraints. Moreover, FCDS divides the solution process of complex CMOP into multiple stages from easy to difficult, and uses adaptive methods to increase the difficulty level of the problem. Systematic experiments on four test suites and three real-world applications have conclusively demonstrated the superior competitiveness of FCDS against leading algorithms.