In recent years, when solving MOPs, especially discrete path optimization problems, MOACOs concerning other meta-heuristic algorithms have been used and improved often, and they have become a hot research topic. This article will start from the basic process of ant colony algorithms for solving MOPs to illustrate the differences between each step. Secondly, we provide a relatively complete classification of algorithms from different aspects, in order to more clearly reflect the characteristics of different algorithms. After that, considering the classification result, we have carried out a comparison of some typical algorithms which are from different categories on different sizes TSP (traveling salesman problem) instances and analyzed the results from the perspective of solution quality and convergence rate. Finally, we give some guidance about the selection of these MOACOs to solve problem and some research works for the future.

With the rapid development of 3D acquisition technology, point clouds have received increasing attention. In recent years, point cloud-based deep learning has been applied to various industrial scenarios, promoting industrial intelligence. However, there is still a lack of review on the application of point cloud-based deep learning in industrial production. To bridge this gap and inspire future research, this article provides a review of current point cloud-based deep learning methods applied to industrial production from the perspective of different application scenarios, including pose estimation, defect inspection, measurement and estimation, and so on. Considering the real-time requirement of industrial production, this article also summarizes real-time point cloud-based deep learning methods in each application scenario. Then, this article introduces commonly used evaluation metrics and public industrial point cloud datasets. Finally, from the aspects of the dataset, speed and industrial product specificity, the challenges faced by current point cloud-based deep learning methods in industrial production are discussed, and future research directions are prospected.

The decomposition-based multi-objective optimization algorithm MOEA/D (multi-objective evolutionary algorithm based on decomposition) introduces the concept of neighborhood, where each sub-problem requires optimization through solutions within its neighborhood. Due to the comparison being only with solutions in the neighborhood, the obtained set of solutions is not sufficiently diverse, leading to poorer convergence properties. In order to adequately acquire a high-quality set of solutions, this algorithm requires a large number of population iterations, which in turn results in relatively low computational efficiency. To address this issue, this paper proposes an algorithm termed MOEA/D-NRD, which is based on neighborhood region domination in the MOEA/D framework. In the improved algorithm, domination relationships are determined by comparing offspring solutions against neighborhood ideal points and neighborhood worst points. By selecting appropriate solution sets within these comparison regions, the solution sets can approach the ideal points more and faster, thereby accelerating population convergence and enhancing the computational efficiency of the algorithm.

The penalty-based boundary cross-aggregation (PBI) method is a common decomposition method of the MOEA/D algorithm, but the strategy of using a fixed penalty parameter in the boundary cross-aggregation function affects the convergence of the populations to a certain extent and is not conducive to the maintenance of the diversity of boundary solutions. To address the above problems, this paper proposes a penalty boundary crossing strategy (DPA) for MOEA/D to adaptively adjust the penalty parameter. The strategy adjusts the penalty parameter values according to the state of uniform distribution of solutions around the weight vectors in the current iteration period, thus helping the optimization process to balance convergence and diversity. In the experimental part, we tested the MOEA/D-DPA algorithm with several MOEA/D improved algorithms on the classical test set. The results show that the MOEA/D with the DPA has better performance than the MOEA/D with the other decomposition strategies.

Aiming to address the complex degenerate primer design problem in the biological field, in this paper, we design a degenerate primer optimization model considering primer coverage and degeneracy that allows a small number of base mismatches, and propose a global optimization method based on the artificial bee colony algorithm. The proposed algorithm combines the idea of the ant colony algorithm with the optimization process of the artificial bee colony algorithm, overcomes the disadvantage of the uncertain candidate solution length of the artificial bee colony algorithm in solving discrete optimization problems, designs the search space model according to the construction process of candidate solution in ant colony optimization algorithm, and redesigns various bee foraging strategies according to the optimization process information. In the comparative experiments on DNA template sequences of different scales, the degenerate primer designed by the proposed algorithm is superior to the existing methods in terms of stability, specificity, coverage and degeneracy.

For the existed biological degenerate primer design problem, a solution method based on an ant colony optimization algorithm is proposed, in which an optimization model considers primer coverage as well as degeneracy while allowing for a small number of base mismatches. Using the construction graph model, the algorithm makes full use of the dynamic change information during the iterative optimal path optimization process, strengthens the explored new path pheromone, and selects the primers that meet the constraints. The results of DNA template sequence matching experiments show that the degenerate primers designed by the proposed algorithm outperform existing approaches.