LZLei Zhou

Lei Zhou

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Lei Zhou has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Corrections to “Toward Adaptive Knowledge Transfer in Multifactorial Evolutionary Computation”

    by Lei Zhou, Liang Feng, Kay Chen Tan, Jinghui Zhong, Zexuan Zhu, Kai Liu, Chao Chen

    Presents corrections to the paper, (Corrections to “Toward Adaptive Knowledge Transfer in Multifactorial Evolutionary Computation”).

  • Scaling Multiobjective Evolution to Large Data With Minions: A Bayes-Informed Multitask Approach

    by Zefeng Chen, Abhishek Gupta, Lei Zhou, Yew-Soon Ong

    In an era of pervasive digitalization, the growing volume and variety of data streams poses a new challenge to the efficient running of data-driven optimization algorithms. Targeting scalable multiobjective evolution under large-instance data, this article proposes the general idea of using subsampled small-data tasks as helpful minions (i.e., auxiliary source tasks) to quickly optimize for large datasets—via an evolutionary multitasking framework. Within this framework, a novel computational resource allocation strategy is designed to enable the effective utilization of the minions while guarding against harmful negative transfers. To this end, an intertask empirical correlation measure is defined and approximated via Bayes’ rule, which is then used to allocate resources online in proportion to the inferred degree of source–target correlation. In the experiments, the performance of the proposed algorithm is verified on: 1) sample average approximations of benchmark multiobjective optimization problems under uncertainty and 2) practical multiobjective hyperparameter tuning of deep neural network models. The results show that the proposed algorithm can obtain up to about 73% speedup relative to existing approaches, demonstrating its ability to efficiently tackle real-world multiobjective optimization involving evaluations on large datasets.


  • Open Access

    Solution Representation Learning in Multi-Objective Transfer Evolutionary Optimization

    by Ray Lim, Lei Zhou, Abhishek Gupta, Yew-Soon Ong, Allan N. Zhang

    This paper presents a first study on solution representation learning for inducing greater alignment and hence positive transfers between distinct multi-objective optimization tasks that bear discrepancies in their original search spaces. We first establish a novel probabilistic model-based multi-objective transfer evolutionary optimization (TrEO) framework with solution representation learning, capable of activating positive transfers while simultaneously curbing the threat of negative transfers. In particular, well-aligned solution representations are learned via spatial transformations to handle mismatches in search space dimensionalities between distinct multi-objective problems, as well as to increase the overlap between their optimized search distributions. We then showcase different algorithmic instantiations and case studies of the proposed framework in applications spanning continuous as well as discrete optimization; illustrative examples include multi-objective engineering design and route planning of unmanned aerial vehicles. The experimental results show that our framework helps induce positive transfers by unveiling useful but hidden inter-task relationships, thus bringing about faster search convergence to solutions of high quality in multi-objective TrEO.


  • Learnable Evolutionary Search Across Heterogeneous Problems via Kernelized Autoencoding

    by Lei Zhou, Liang Feng, Abhishek Gupta, Yew-Soon Ong

    The design of the evolutionary algorithm with learning capability from past search experiences has attracted growing research interests in recent years. It has been demonstrated that the knowledge embedded in the past search experience can greatly speed up the evolutionary process if properly harnessed. Autoencoding evolutionary search (AEES) is a recently proposed search paradigm, which employs a single-layer denoising autoencoder to build the mapping between two problems by configuring the solutions of each problem as the input and output for the autoencoder, respectively. The learned mapping makes it possible to perform knowledge transfer across heterogeneous problem domains with diverse properties. It has shown a promising performance of learning and transferring the knowledge from past search experiences to facilitate the evolutionary search on a variety of optimization problems. However, despite the success enjoyed by AEES, the linear autoencoding model cannot capture the nonlinear relationship between the solution sets used in the mapping construction. Taking this cue, in this article, we devise a kernelized autoencoder to construct the mapping in a reproducing kernel Hilbert space (RKHS), where the nonlinearity among problem solutions can be captured easily. Importantly, the proposed kernelized autoencoding method also holds a closed-form solution which will not bring much computational burden in the evolutionary search. Furthermore, a kernelized autoencoding evolutionary-search (KAES) paradigm is proposed that adaptively selects the linear and kernelized autoencoding along the search process in pursuit of effective knowledge transfer across problem domains. To validate the efficacy of the proposed KAES, comprehensive empirical studies on both benchmark multiobjective optimization problems as well as real-world vehicle crashworthiness design problem are presented.


  • Top Cited Papers

    Toward Adaptive Knowledge Transfer in Multifactorial Evolutionary Computation

    by Lei Zhou, Liang Feng, Kay Chen Tan, Jinghui Zhong, Zexuan Zhu, Kai Liu, Chao Chen, Jun Zhang

    A multifactorial evolutionary algorithm (MFEA) is a recently proposed algorithm for evolutionary multitasking, which optimizes multiple optimization tasks simultaneously. With the design of knowledge transfer among different tasks, MFEA has demonstrated the capability to outperform its single-task counterpart in terms of both convergence speed and solution quality. In MFEA, the knowledge transfer across tasks is realized via the crossover between solutions that possess different skill factors. This crossover is thus essential to the performance of MFEA. However, we note that the present MFEA and most of its existing variants only employ a single crossover for knowledge transfer, and fix it throughout the evolutionary search process. As different crossover operators have a unique bias in generating offspring, the appropriate configuration of crossover for knowledge transfer in MFEA is necessary toward robust search performance, for solving different problems. Nevertheless, to the best of our knowledge, there is no effort being conducted on the adaptive configuration of crossovers in MFEA for knowledge transfer, and this article thus presents an attempt to fill this gap. In particular, here, we first investigate how different types of crossover affect the knowledge transfer in MFEA on both single-objective (SO) and multiobjective (MO) continuous optimization problems. Furthermore, toward robust and efficient multitask optimization performance, we propose a new MFEA with adaptive knowledge transfer (MFEA-AKT), in which the crossover operator employed for knowledge transfer is self-adapted based on the information collected along the evolutionary search process. To verify the effectiveness of the proposed method, comprehensive empirical studies on both SO and MO multitask benchmarks have been conducted. The experimental results show that the proposed MFEA-AKT is able to identify the appropriate knowledge transfer crossover for different optimization problems and even at different optimization stages along the search, which thus leads to superior or competitive performances when compared to the MFEAs with fixed knowledge transfer crossover operators.


  • Top Cited Papers

    Explicit Evolutionary Multitasking for Combinatorial Optimization: A Case Study on Capacitated Vehicle Routing Problem

    by Liang Feng, Yuxiao Huang, Lei Zhou, Jinghui Zhong, Abhishek Gupta, Ke Tang, Kay Chen Tan

    Recently, evolutionary multitasking (EMT) has been proposed in the field of evolutionary computation as a new search paradigm, for solving multiple optimization tasks simultaneously. By sharing useful traits found along the evolutionary search process across different optimization tasks, the optimization performance on each task could be enhanced. The autoencoding-based EMT is a recently proposed EMT algorithm. In contrast to most existing EMT algorithms, which conduct knowledge transfer across tasks implicitly via crossover, it intends to perform knowledge transfer explicitly among tasks in the form of task solutions, which enables the employment of task-specific search mechanisms for different optimization tasks in EMT. However, the autoencoding-based explicit EMT can only work on continuous optimization problems. It will fail on combinatorial optimization problems, which widely exist in real-world applications, such as scheduling problem, routing problem, and assignment problem. To the best of our knowledge, there is no existing effort working on explicit EMT for combinatorial optimization problems. Taking this cue, in this article, we thus embark on a study toward explicit EMT for combinatorial optimization. In particular, by using vehicle routing as an illustrative combinatorial optimization problem, the proposed explicit\pagebreak EMT algorithm (EEMTA) mainly contains a weighted l₁-norm-regularized learning process for capturing the transfer mapping, and a solution-based knowledge transfer process across vehicle routing problems (VRPs). To evaluate the efficacy of the proposed EEMTA, comprehensive empirical studies have been conducted with the commonly used vehicle routing benchmarks in multitasking environment, against both the state-of-the-art EMT algorithm and the traditional single-task evolutionary solvers. Finally, a real-world combinatorial optimization application, that is, the package delivery problem (PDP), is also presented to further confirm the efficacy of the proposed algorithm.


  • Solving Generalized Vehicle Routing Problem With Occasional Drivers via Evolutionary Multitasking

    by Liang Feng, Lei Zhou, Abhishek Gupta, Jinghui Zhong, Zexuan Zhu, Kay-Chen Tan, Kai Qin

    With the emergence of crowdshipping and sharing economy, vehicle routing problem with occasional drivers (VRPOD) has been recently proposed to involve occasional drivers with private vehicles for the delivery of goods. In this article, we present a generalized variant of VRPOD, namely, the vehicle routing problem with heterogeneous capacity, time window, and occasional driver (VRPHTO), by taking the capacity heterogeneity and time window of vehicles into consideration. Furthermore, to meet the requirement in today's cloud computing service, wherein multiple optimization tasks may need to be solved at the same time, we propose a novel evolutionary multitasking algorithm (EMA) to optimize multiple VRPHTOs simultaneously with a single population. Finally, 56 new VRPHTO instances are generated based on the existing common vehicle routing benchmarks. Comprehensive empirical studies are conducted to illustrate the benefits of the new VRPHTOs and to verify the efficacy of the proposed EMA for multitasking against a state-of-art single task evolutionary solver. The obtained results showed that the employment of occasional drivers could significantly reduce the routing cost, and the proposed EMA is not only able to solve multiple VRPHTOs simultaneously but also can achieve enhanced optimization performance via the knowledge transfer between tasks along the evolutionary search process.