Multitask optimization (MTO) is a new optimization paradigm that leverages useful information contained in multiple tasks to help solve each other. It attracts increasing attention in recent years and gains significant performance improvements. However, the solutions of distinct tasks usually obey different distributions. To avoid that individuals after intertask learning are not suitable for the original task due to the distribution differences and even impede overall solution efficiency, we propose a novel multitask evolutionary framework that enables knowledge aggregation and online learning among distinct tasks to solve MTO problems. Our proposal designs a domain adaptation-based mapping strategy to reduce the difference across solution domains and find more genetic traits to improve the effectiveness of information interactions. To further improve the algorithm performance, we propose a smart way to divide initial population into different subpopulations and choose suitable individuals to learn. By ranking individuals in target subpopulation, worse-performing individuals can learn from other tasks. The significant advantage of our proposed paradigm over the state of the art is verified via a series of MTO benchmark studies.
15 May 2025 in IEEE/CAA Journal of Automatica Sinica
When dealing with expensive multiobjective optimization problems, majority of existing surrogate-assisted evolutionary algorithms (SAEAs) generate solutions in decision space and screen candidate solutions mostly by using designed surrogate models. The generated solutions exhibit excessive randomness, which tends to reduce the likelihood of generating good-quality solutions and cause a long evolution to the optima. To improve SAEAs greatly, this work proposes an evolutionary algorithm based on surrogate and inverse surrogate models by 1) Employing a surrogate model in lieu of expensive (true) function evaluations; and 2) Proposing and using an inverse surrogate model to generate new solutions. By using the same training data but with its inputs and outputs being reversed, the latter is simple to train. It is then used to generate new vectors in objective space, which are mapped into decision space to obtain their corresponding solutions. Using a particular example, this work shows its advantages over existing SAEAs. The results of comparing it with state-of-the-art algorithms on expensive optimization problems show that it is highly competitive in both solution performance and efficiency.
17 October 2024 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Large-scale many-objective optimization problems (LSMaOPs) pose great difficulties for traditional evolutionary algorithms due to their slow search for Pareto-optimal solutions in huge decision space and struggle to balance diversity and convergence among numerous locally optimal solutions. An objective space linear inverse mapping method has successfully achieved great saving in execution time in solving LSMaOPs. Linear mapping is a fast and straightforward way, but fails to characterize a complex functional relationship. If we can enhance the expressive capacity of a mapping model, and further obtain a more general function approximator, can the evolutionary search based on objective space mapping be more efficient? To answer this interesting question, this work proposes to employ nonlinear activation functions widely used in neural networks so as to enhance the efficiency of objective space inverse mapping, thus efficiently generating excellent offspring population. A new evolutionary optimization framework based on decision variable analysis is proposed to solve LSMaOPs. In order to demonstrate its performance, this work carries out empirical experiments involving massive decision variables and many objectives. Experimental results prove its superiority over some representative and updated ones.
7 February 2023 in IEEE Transactions on Intelligent Transportation Systems
The airline crew pairing (ACP) problem is one of the most challenging problems in airline operations. It aims to decide the optimal connections among pairs of flights assigned to flight crews. However, the number of connections grows exponentially with the increasing number of flights. Conventional approaches usually follow a two-stage method, i.e., divide-and-conquer. The flight sequences (pairings) spanning multiple days are firstly generated for each crew. Then, the best pairing set is chosen based on minimum operational costs. When the number of flights is large, it becomes too difficult to generate all feasible pairings and find the optimum. In order to solve large-scale ACP problems efficiently, we propose a novel iterative optimization framework based on monte carlo tree search (MCTS). Thus, the speed of pairing generation and solution accuracy can be improved. To evaluate the performance of the proposed method, we conduct experiments on different scales of real-world instances provided by airline companies. The empirical results show that the proposed approach is capable of producing high-quality solutions, especially in large-scale instances.
Multi-task optimization (MTO) is a novel emerging evolutionary computation paradigm. It focuses on solving multiple optimization tasks concurrently while improving optimization performance by utilizing similarities among tasks and historical optimization knowledge. To ensure its high performance, it is important to choose proper individuals for each task. Most MTO algorithms limit each individual to one task, which weakens the effects of information exchange. To improve the efficiency of knowledge transfer and choose more suitable individuals to learn from other tasks, this work proposes a general MTO framework named individually guided multi-task optimization (IMTO). It divides evolutions into vertical and horizontal ones, and each individual is fully explored to learn experience from the execution of other tasks. By using the concept of skill membership, individuals with higher solving ability are selected. Besides, to further improve the effect of knowledge transfer, only inferior individuals are selected to learn from other tasks at each generation. The significant advantage of IMTO over the multifactorial evolutionary framework and baseline solvers is verified via a series of benchmark studies.
13 June 2025 in IEEE/CAA Journal of Automatica Sinica
To realize Industry 5.0, manufacturers face various optimization problems that seldom appear in isolation. Evolutionary MultiTasking (EMT) is an effective method to solve multiple related problems by extracting and utilizing common knowledge. Knowledge transfer is the key to the effectiveness of EMT. Existing EMT methods mainly focus on designing effective intertask learning methods and ignore the fact that provided knowledge's appropriateness also has a significant effect on EMT's performance. There is plentiful knowledge in assistant tasks, and knowledge transfer may not work well and even lead to a negative effect if useless knowledge is selected to guide target tasks. EMT is thus confronted with a challenge to find appropriate knowledge. This work proposes an efficient knowledge classification-assisted EMT framework to identify and select valuable knowledge from assistant tasks. During the evolution process, better-performing candidates are supposed to have advantages in exploitation. Therefore, assistant individuals that are similar to better-performing target individuals are used to provide positive knowledge. Specifically, the target sub-population is divided into different levels and then a classifier is trained to divide assistant sub-population. Considering that target and assistant sub-populations have different characteristics, we use domain adaptation to reduce their distribution discrepancies. In this way, the trained classifier can classify assistant individuals more accurately, and truly useful knowledge can be selected for target tasks. The superior performance of our proposed framework over state-of-the-art algorithms is verified via a series of benchmark problems.