Constraints Separation Based Evolutionary Multitasking for Constrained Multi-Objective Optimization Problems

Constrained multi-objective optimization problems(CMOPs)generally contain multiple constraints,which not only form multiple discrete feasible regions but also reduce the size of optimal feasible regions,thus they propose serious challenges for solvers.Among all constraints,some constraints are highly correlated with optimal feasible regions;thus they can provide effective help to find feasible Pareto front.However,most of the existing constrained multi-objective evolutionary algorithms tackle constraints by regarding all constraints as a whole or directly ignoring all constraints,and do not consider judging the relations among constraints and do not utilize the information from promising single constraints.Therefore,this paper attempts to identify promising single constraints and utilize them to help solve CMOPs.To be specific,a CMOP is transformed into a multitasking optimization problem,where multiple auxiliary tasks are created to search for the Pareto fronts that only consider a single constraint respectively.Besides,an auxiliary task priority method is designed to identify and retain some high-related auxiliary tasks according to the information of relative positions and dominance relationships.Moreover,an improved tentative method is designed to find and transfer useful knowledge among tasks.Experimental results on three benchmark test suites and 11 realworld problems with different numbers of constraints show better or competitive performance of the proposed method when compared with eight state-of-the-art peer methods.

Evolutionary Multitasking With Global and Local Auxiliary Tasks for Constrained Multi-Objective Optimization

Constrained multi-objective optimization problems(CMOPs) include the optimization of objective functions and the satisfaction of constraint conditions, which challenge the solvers.To solve CMOPs, constrained multi-objective evolutionary algorithms(CMOEAs) have been developed. However, most of them tend to converge into local areas due to the loss of diversity. Evolutionary multitasking(EMT) is new model of solving complex optimization problems, through the knowledge transfer between the source task and other related tasks. Inspired by EMT, this paper develops a new EMT-based CMOEA to solve CMOPs, in which the main task, a global auxiliary task, and a local auxiliary task are created and optimized by one specific population respectively. The main task focuses on finding the feasible Pareto front(PF), and global and local auxiliary tasks are used to respectively enhance global and local diversity. Moreover, the global auxiliary task is used to implement the global search by ignoring constraints, so as to help the population of the main task pass through infeasible obstacles. The local auxiliary task is used to provide local diversity around the population of the main task, so as to exploit promising regions. Through the knowledge transfer among the three tasks, the search ability of the population of the main task will be significantly improved. Compared with other state-of-the-art CMOEAs, the experimental results on three benchmark test suites demonstrate the superior or competitive performance of the proposed CMOEA.

Effect of substrate type on Ni self-assembly process

Ni self-assembly has been performed on Ga N(0001), Si(111) and sapphire(0001) substrates. Scanning electron microscopy(SEM) images verify that the Si(111) substrate leads to failure of the Ni assembly due to Si–N interlayer formation; the GaN(0001) and sapphire(0001) substrates promote assembly of the Ni particles. This indicates that the GaN/sapphire(0001) substrates are fit for Ni self-assembly. For the Ni assembly process on Ga N/sapphire(0001) substrates,three differences are observed from the x-ray diffraction(XRD) patterns:(i) Ni self-assembly on the sapphire(0001) needs a 900?C annealing temperature, lower than that on the GaN(0001) at 1000?C, and loses the Ni network structure stage;(ii) the Ni particle shape is spherical for the sapphire(0001) substrate, and truncated-cone for the GaN(0001) substrate; and(iii) a Ni–N interlayer forms between the Ni particles and the GaN(0001) substrate, but an interlayer does not appear for the sapphire(0001) substrate. All these differences are attributed to the interaction between the Ni and the Ga N/sapphire(0001) substrates. A model is introduced to explain this mechanism.

Differential Evolution with Level-Based Learning Mechanism

To address complex single objective global optimization problems,a new Level-Based Learning Differential Evolution(LBLDE)is developed in this study.In this approach,the whole population is sorted from the best to the worst at the beginning of each generation.Then,the population is partitioned into multiple levels,and different levels are used to exert different functions.In each level,a control parameter is used to select excellent exemplars from upper levels for learning.In this case,the poorer individuals can choose more learning exemplars to improve their exploration ability,and excellent individuals can directly learn from the several best individuals to improve the quality of solutions.To accelerate the convergence speed,a difference vector selection method based on the level is developed.Furthermore,specific crossover rates are assigned to individuals at the lowest level to guarantee that the population can continue to update during the later evolutionary process.A comprehensive experiment is organized and conducted to obtain a deep insight into LBLDE and demonstrates the superiority of LBLDE in comparison with seven peer DE variants.

A New Road Extraction Method from Satellite Images Using Genetic Programming

Extracting roads from satellite images is an important task in thefield of computer vision with a wide range of applications.However,efficient road extraction from satellite images remains a complex challenge due to issues such as data labeling and the diversity of road features.Existing methods often struggle to balance accuracy,robustness,and interpretability.Genetic programming(GP)is based on aflexible and interpretable structure that is robust and does not require a large amount of data support.We position the road extraction problem as a binary semantic segmentation task and introduce GP algorithms.First,an approach for extracting pixel neighborhood features is proposed,and features from multiple images in the DeepGlobe road extraction dataset are extracted.Then,an advanced feature construction method based on GP is employed.Finally,these advanced features are utilized for training classifier and classi-fication to achieve road extraction.We have validated the effectiveness of the approach on the DeepGlobe road extraction dataset.The results demonstrated that the proposed approach exhibits superior performance compared to traditional classification methods and multilayer perceptron(MLP)in terms of accuracy,generalization,and interpretability.This study provides a valuable reference for the integration of GP into the domain of road extraction from satellite images,showcasing their potential to enhance the accuracy and efficiency.