YLYongsheng Liang

Yongsheng Liang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yongsheng Liang has a total of 36 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Predicting Aircraft Taxi Time at Airport with RReliefF Feature Selection and Machine Learning Methods

    by Yongsheng Liang, Shenghao Fu, Kai Wang, Zhiqian Jiang, Xiaole Wang

    Taxiing is one of the most important operational processes in airports. Accurately predicting aircraft taxi time is essential for achieving efficient and robust airport management. In recent decades, taxi time prediction has received considerable research attention and machine learning prediction algorithms are perhaps the most popular methods in this field. However, existing research mainly concentrates on developing various taxi time prediction methods by adopting existing machine learning models and testing their performance is different airports. Another vital process, i.e., feature selection, receives relatively less attention, which may lead to some unnecessary features being involved in the taxi time prediction process and eventually reducing the overall prediction accuracy. To address the shortage of traditional prediction methods, this study integrates a popular feature selection technique with different machine learning models to develop more efficient taxi time prediction methods. Before starting the prediction process, the RReliefF feature selection method is employed to identify important features and form the feature subset, which is helpful to not only improve the prediction accuracy but also reduce computational complexity. Based on the obtained feature subset, three prediction models including multiple linear regression, support vector regression and artificial neural network are trained and used to realize accurate taxi time prediction. To investigate the performance of the proposed prediction methods, historical flight data from an international airport is collected to test their performance. Experimental results indicate that feature selection technique has the potential to enhance the taxi time prediction ability and save computing resources during the prediction process.


  • Reinforcement Learning Based Airport Runway Risk Decision

    by Zhiqian Jiang, Fan Bao, Yongsheng Liang, Jie Hu, Mingwei Zhang

    The continuous growth of civil airport throughput brings enormous pressure to airport safety management. The existing passive safety management method cannot efficiently control risk in advance and lacks consideration of airport operation efficiency, leading to degradation on airport operation efficiency. To overcome these issues, we propose a reinforcement learning based runway risk decision method which dynamically adjusts the take-off and landing runway for the upcoming flight, based on current pavement crack level and airport operation status. Besides, a risk decision evaluation metrics that can comprehensively reflect the airport operation efficiency and safety is designed to evaluate the pros and cons of risk decision-making. Furthermore, to evaluate the robustness of risk decision, the impact of different parameter settings and network structures on the method performance are compared. Experimental results show that our proposed method improves the comprehensive evaluation of safety and efficiency by 1.50%–37.41%.

  • An Efficient Adaptive Differential Grouping Algorithm for Large-Scale Black-Box Optimization

    by An Chen, Zhigang Ren, Wenhua Guo, Yongsheng Liang, Zuren 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.


  • Scaling Up Radial Basis Function for High-Dimensional Expensive Optimization Using Random Projection

    by Daofu Guo, Zhigang Ren, Yongsheng Liang, 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.


  • Open Access

    Bi-Hierarchical Cooperative Coevolution for Large Scale Global Optimization

    by Zhigang Ren, An Chen, Muyi Wang, Yang Yang, Yongsheng Liang, 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.


  • An efficient estimation of distribution algorithm with rank-one modification and population reduction

    by Yongsheng Liang, Zhigang Ren, Miao He, Lin Wang, Jianfu Cao, An Chen, Bei Pang


  • Enhancing Gaussian Estimation of Distribution Algorithm by Exploiting Evolution Direction With Archive

    by Yongsheng Liang, Zhigang Ren, Xianghua Yao, Zuren Feng, An Chen, Wenhua Guo

    As a typical model-based evolutionary algorithm, estimation of distribution algorithm (EDA) possesses unique characteristics and has been widely applied in global optimization. However, the commonly used Gaussian EDA (GEDA) usually suffers from premature convergence, which severely limits its search efficiency. This paper first systematically analyzes the reasons for the deficiency of traditional GEDA, then tries to enhance its performance by exploiting the evolution direction, and finally develops a new GEDA variant named EDA². Instead of only utilizing some good solutions produced in the current generation to estimate the Gaussian model, EDA² preserves a certain number of high-quality solutions generated in the previous generations into an archive and employs these historical solutions to assist estimating the covariance matrix of Gaussian model. By this means, the evolution direction information hidden in the archive is naturally integrated into the estimated model, which in turn can guide EDA² toward more promising solution regions. Moreover, the new estimation method significantly reduces the population size of EDA² since it needs fewer individuals in the current population for model estimation. As a result, a fast convergence can be achieved. To verify the efficiency of EDA², we tested it on a variety of benchmark functions and compared it with several state-of-the-art EAs. The experimental results demonstrate that EDA² is efficient and competitive.


  • Surrogate model assisted cooperative coevolution for large scale optimization

    by Zhigang Ren, Bei Pang, Muyi Wang, Zuren Feng, Yongsheng Liang, An Chen, Yipeng Zhang


  • Boosting Cooperative Coevolution for Large Scale Optimization With a Fine-Grained Computation Resource Allocation Strategy

    by Zhigang Ren, Yongsheng Liang, Aimin Zhang, Yang Yang, Zuren Feng, Lin Wang

    Cooperative coevolution (CC) has shown great potential for solving large-scale optimization problems (LSOPs). However, traditional CC algorithms often waste part of the computation resource (CR) as they equally allocate CR among all subproblems. The recently developed contribution-based CC algorithms improve the traditional ones to a certain extent by adaptively allocating CR according to some heuristic rules. Different from existing works, this paper explicitly constructs a mathematical model for the CR allocation (CRA) problem in CC and proposes a novel fine-grained CRA (FCRA) strategy by fully considering both the theoretically optimal solution of the CRA model and the evolution characteristics of CC. FCRA takes a single iteration as a basic CRA unit and always selects the subproblem which is most likely to make the largest contribution to the total fitness improvement to undergo a new iteration, where the contribution of a subproblem at a new iteration is estimated according to its current contribution, current evolution status, as well as the estimation for its current contribution. We verified the efficiency of FCRA by combining it with the success-history-based adaptive differential evolution which is an excellent DE variant but has never been employed in the CC framework. Experimental results on two benchmark suites for LSOPs demonstrate that FCRA significantly outperforms existing CRA strategies and the resulting CC algorithm is highly competitive in solving LSOPs.