In response to the multifactory collaborative distributed characteristics of building material equipment during the manufacturing process, this paper studies the two‐stage (production–assembly) distributed assembly flexible job shop scheduling problem (DAFJSP) and constructs a corresponding mathematical model. To address this complex NP‐hard problem, a hybrid genetic algorithm with variable neighborhood search (HGA‐VNS) is proposed. The algorithm integrates multiple crossover and mutation strategies, thereby significantly enhancing global search capabilities. Concurrently, the implementation of four neighborhood operations has been demonstrated to enhance local search efficiency. To validate the effectiveness and superiority of the proposed algorithm, comparative experiments with other scheduling algorithms were conducted. The findings indicate that the proposed algorithm demonstrates notable advantages in addressing the DAFJSP.

This paper investigates an integrated production scheduling and vehicle routing problem with soft time windows and fuzzy travel times, where orders are grouped into batches for production and delivered by a limited number of multi-trip heterogeneous vehicles. A bi-objective mixed integer nonlinear programming (MINLP) model is established, which takes total cost and total early and tardy weighted penalty time as optimization objectives. First, a fuzzy superposition operation is proposed to obtain the fuzzy weighted penalty time, and it is extended to a generalized fuzzy operation law in fuzzy sets and systems. Then, we propose a knowledge-driven co-evolutionary algorithm (KDCEA) to solve this problem. The algorithm fuses a dual-subpopulation co-evolution based on different update strategies and a knowledge-driven strategy based on dynamic knowledge sets and problem-specific knowledge. Finally, the correctness of the MINLP model is verified by the CPLEX solver using the ϵ-constraint method. A computational experiment is conducted based on different scale instances and a real-world case, and the results show the superiority of KDCEA in solving this problem.

Abstract The processing of high-dimensional datasets has become unavoidable with the development of information technology. Most of the literature on feature selection (FS) of high-dimensional datasets focuses on improvements in search strategies, ignoring the characteristics of the dataset itself such as the correlation and redundancy of each feature. This could degrade the algorithm's search effectiveness. Thus, this paper proposes a correlation-redundancy guided evolutionary algorithm (CRGEA) to address high-dimensional FS with the objectives of optimizing classification accuracy and the number of features simultaneously. A new correlation-redundancy assessment method is designed for selecting features with high relevance and low redundancy to speed up the entire evolutionary process. In CRGEA, a novel initialization strategy combined with a multiple threshold selection mechanism is developed to produce a high-quality initial population. A local acceleration evolution strategy based on a parallel simulated annealing algorithm and a pruning method is developed, which can search in different directions and perform deep searches combing the annealing stage around the best solutions to improve the local search ability. Finally, the comparison experiments on 16 public high-dimensional datasets verify that the designed CRGEA outperforms other state-of-the-art intelligent algorithms. The CRGEA can efficiently reduce redundant features while ensuring high accuracy.