This paper studies a novel and practical distributed flexible assembly permutation flowshop scheduling problem with makespan criterion, which has attracted wide attention due to important applications in modern manufacturing. The problem integrates two machine environments of distributed production and flexible assembly, which can process and assemble the jobs into customized products. We first present a mixed integer linear programming model to characterize the problem essence and to solve small-size problems. Due to the NP-hard, we further propose an efficient memetic algorithm, which consists of a global exploration optimizer designed based on improved social spider optimization and two local exploitation optimizers designed based on meta-Lamarckian learning and simplex search, respectively. To implement the algorithm, a problem-specific encoding scheme is presented. Algorithmic parameters are calibrated by a design of experiments, and a comprehensive computational campaign is conducted to evaluate the performance of the mathematical model and algorithms. Statistical results show that their problem-solving abilities are effective, and especially the proposed memetic algorithm outperforms the existing algorithms significantly.

In the domain of autonomous driving systems, vehicle trajectory prediction represents a critical aspect, as it significantly contributes to the safe maneuvering of vehicles within intricate traffic environments. Nevertheless, a preponderance of extant research efforts have been chiefly centered on the spatio-temporal relationships intrinsic to the vehicle itself, thereby exhibiting deficiencies in the dynamic perception of and interaction capabilities with adjacent vehicles. In light of this limitation, we propose a vehicle trajectory prediction algorithm predicated on a hybrid prediction model. Initially, the algorithm extracts pertinent context information pertaining to the target vehicle and its neighboring vehicles through the application of a two-layer long short-term memory network. Subsequently, a fusion module is deployed to assimilate the characteristics of the temporal influence, spatial influence, and interactive influence of the surrounding vehicles, followed by the integration of these attributes. Ultimately, the prediction module is engaged to yield the predicted movement positions of the vehicles, expressed in coordinate form. The proposed algorithm was trained and validated using the publicly accessible datasets I-80 and US-101. The experimental results demonstrate that our proposed algorithm is capable of generating more precise prediction results.

With the emergence of the multicore architecture and the increase of chip operating frequency, power optimization has become a key step of circuit logic synthesis. Aiming at the XNOR/OR circuits, with the goal of minimizing power, construct the optimal polarity fixed-polarity Reed–Muller (FPRM) circuits power optimization scheme. However, the power optimization for FPRM circuits is a multipeak combinatorial optimization problem, we first propose a metaheuristic optimization algorithm (MOA), which includes the global exploration optimizer, local deep exploitation optimizer, and initial population and uses the proposed differential evolution optimization, fierce wolf siege algorithm-based tabu search, and improved skew tent map to make the population evolve. Based on the proposed Huffman tree construction algorithm and MOA, we propose an efficient power optimization approach (EPOA) to find the minimum power FPRM circuit. Experimental results on the benchmark circuits confirm the effectiveness of EPOA.

Power is an issue that must be considered in the design of logic circuits. Power optimization is a combinatorial optimization problem, since it is necessary to search for a logical expression that consumes the least amount of power from a large number of Reed-Muller (RM) logical expressions. The existing approach for optimizing the power of multi-output mixed polarity RM (MPRM) logic circuits suffer from poor optimization results. To solve this problem, a whale optimization algorithm with two-populations strategy and mutation strategy (TMWOA) is proposed in this paper. The two-populations strategy speeds up the convergence of the algorithm by exchanging information about the two-populations. The mutation strategy enhances the ability of the algorithm to jump out of the local optimal solutions by using the information of the current optimal solution. Based on the TMWOA, we propose a multi-output MPRM logic circuits power optimization approach (TMMPOA). Experiments based on the benchmark circuits of the Microelectronics Center of North Carolina (MCNC) validate the effectiveness and superiority of the proposed TMMPOA.