Comparison Of Algorithms Research Articles

Deep reinforcement learning and ant colony optimization supporting multi‐UGV path planning and task assignment in 3D environments

AbstractWith the development of artificial intelligence, the application of unmanned ground vehicles (UGV) in outdoor hazardous scenarios has received more attention. However, the terrains in these environments are often complex and undulating, which also pose higher challenges to the multi‐UGV path planning and task assignment (MUPPTA) optimization. To efficiently improve the multi‐UGV collaboration in 3D environments, a MUPPTA method is proposed based on double deep Q learning network (DDQN) and ant colony optimization (ACO) to jointly optimize the path planning and task assignment decisions of multiple UGVs. The authors first comprehensively consider the characteristics of the 3D environments, and model the MUPPTA problem as a combinatorial optimization problem. To tackle it, the original problem is decomposed into the multi‐UGV path planning sub‐problem and task assignment sub‐problem, and solve them separately. First, the path planning sub‐problem in the 3D environments is transformed into a Markov decision process (MDP) model, and a multi‐UGV path planning algorithm based on DDQN (MUPP‐DDQN) is proposed to obtain the optimal paths and actual path costs between tasks through extensive offline learning and training. Based on this, a multi‐UGV task assignment algorithm is further proposed based on ACO (MUTA‐ACO) to solve the task assignment sub‐problem and achieve the optimal task assignment solution. Simulation results show that the proposed method is more cost‐effective and time‐saving compared to other comparison algorithms.

Application of artificial bee colony algorithm based on homogenization mapping and collaborative acquisition control in network communication security.

In order to optimize the spectrum allocation strategy of existing wireless communication networks and improve information transmission efficiency and data transmission security, this study uses the independent correlation characteristics of chaotic time series to simulate the collection and control strategy of bees, and proposes an artificial bee colony algorithm based on uniform mapping and collaborative collection control. Furthermore, it proposes an artificial bee colony algorithm based on uniform mapping and collaborative collection and control. The method begins by establishing a composite system of uniformly distributed Chebyshev maps. In the neighborhood intervals where the nectar sources are firmly connected and relatively independent, the algorithm then conducts a chaotic traversal search. The research results demonstrated the great performance of the suggested algorithm in each test function as well as the positive effects of the optimization search. The network throughput rate was over 300 kbps, the quantity of security service eavesdropping was below 0.1, and the spectrum utilization rate of the algorithm-based allocation method could be enhanced to 0.8 at the most. Overall, the performance of the proposed algorithm outperformed the comparison algorithm, with high optimization accuracy and a significant amount of optimization. This is favorable for the efficient use of spectrum resources and the secure transmission of communication data, and it encourages the development of spectrum allocation technology in wireless communication networks.

An Improved Football Team Training Algorithm for Global Optimization.

The football team training algorithm (FTTA) is a new metaheuristic algorithm that was proposed in 2024. The FTTA has better performance but faces challenges such as poor convergence accuracy and ease of falling into local optimality due to limitations such as referring too much to the optimal individual for updating and insufficient perturbation of the optimal agent. To address these concerns, this paper presents an improved football team training algorithm called IFTTA. To enhance the exploration ability in the collective training phase, this paper proposes the fitness distance-balanced collective training strategy. This enables the players to train more rationally in the collective training phase and balances the exploration and exploitation capabilities of the algorithm. To further perturb the optimal agent in FTTA, a non-monopoly extra training strategy is designed to enhance the ability to get rid of the local optimum. In addition, a population restart strategy is then designed to boost the convergence accuracy and population diversity of the algorithm. In this paper, we validate the performance of IFTTA and FTTA as well as six comparison algorithms in CEC2017 test suites. The experimental results show that IFTTA has strong optimization performance. Moreover, several engineering-constrained optimization problems confirm the potential of IFTTA to solve real-world optimization problems.

A dyeing clustering algorithm based on ant colony path-finding mechanism

Clustering has a wide range of applications in various industries. In different research ideas, bionic algorithms have heuristic help for clustering research. However, most of the clustering algorithms based on bionics often have problems of insufficient information extraction, too many required parameters, and limited application scope. Therefore, these algorithms have lower accuracy than traditional clustering algorithms. To solve these problems, this paper proposes a new ant colony clustering algorithm, which is called Dyeing Clustering Algorithm based on Ant Colony Path-finding. This algorithm combines the idea of dyeing with pheromones for the first time and realizes clustering by using ants to crawl and dye each point, bringing new inspiration to the artificial intelligence research. This can better capture data features, improve fault tolerance and achieve a better clustering effect. In addition, the algorithm is constructed as a dynamic system to deeply mine data information with the strategy of swarm intelligence, including the ant colony generation model, path-finding model, path-finding termination model, and dyeing clustering model. Besides, to evaluate the algorithm, we selected 2 simulation data sets, 5 artificial data sets, 5 real-world data sets, 13 comparison algorithms, and 8 evaluation indexes. From the comprehensive multi-round experiments, seven of the eight evaluation indexes of the Dyeing Clustering Algorithm based on Ant Colony Path-finding algorithm are more advantageous than other comparison algorithms, which demonstrates its enormous potential in industrial applications.

Multi-level guided evolution algorithm for solving fuzzy flexible job shop problem

Traditional flexible job shop scheduling problems (FJSP) are mostly limited to deterministic environments. In actual production, some uncertain factors lead to changes in job processing time. When solving multi-objective fuzzy flexible job shop scheduling problems (MOFFJSP), the existing evolutionary algorithms do not fully utilize information transfer between levels during the population evolution process. Therefore, a multi-level guided evolutionary (MLGE) optimization method is proposed to solve MOFFJSP. In the proposed MLGE method, decomposition and dominance techniques are combined to balance the diversity and convergence performance of the algorithm. Meanwhile, the idea of the Jaya algorithm approaching good individuals and distancing poor individuals is introduced. Combined with improved Jaya operator operations, it is used to guide individual evolution, preserving and inheriting solutions that perform well in terms of convergence and diversity. Finally, numerous experiments are carried out to evaluate the effectiveness of MLGE. The results show that MLGE can provide promising results for MOFFJSP. Additionally, it shows how MLGE outperforms other comparison algorithms in terms of convergence and variety of solutions.

Adversarial compact wrapping classifier learning for open set recognition

Determining the limited and compact class acceptance region has become a key bottleneck in classifier design since Open Set Recognition (OSR) requires the classifier to successfully identify those of interest and reject other exceptions. The imperfect match between actual feature distribution of a class and its classification acceptance area is a critical barrier to performance enhancement in recent existing OSR algorithms. Therefore, we propose adversarial compact wrapping classifier learning for OSR, which achieves better feature representation and classification surface division through alternating learning of classifiers and compact wrapping points (CWPs). The core of the algorithm model lies in the confrontational game between CWP and the classifier. First, a new deep and compact hyperspherical crown classifier is designed, which expands neurons to achieve limited and compact classification surface division, improves the classification performance of known classes, and reduces the risk of open space. Then, the CWP algorithm is used to construct negative class sample points that tightly wrap the class feature distribution, and a joint optimization framework of CWP and classifier is constructed. The classifier improves the discrepancy between the class acceptance area of the classification and the actual class distribution area through adversarial learning with CWP, further controls the risk of unknown open spaces, and optimizes the learned feature distribution. It is worth noting that we have developed the CWP to allow concave feature distributions. Experimental results show that the proposed algorithm is significantly superior to recent comparison algorithms on various benchmark datasets and significantly improves OSR performance on the TinyImageNet dataset.

Adaptive Learning Modified Great Deluge Hyper-Heuristics

The International Timetabling Competition (ITC) 2021 focuses on sports scheduling, a domain intricately connected to optimizing combinatorics problems. Within the framework of the ITC 2021 challenge, a crucial task is to precisely allocate matches to their designated time slots. Addressing this challenge involves the utilization of the Adaptive Learning Modified Great Deluge (ALMGD) algorithm, which belongs to the realm of hyper-heuristics. This algorithm represents an evolutionary step from the foundational great deluge algorithm, incorporating an acceptance mechanism intricately woven with self-adaptive learning. To assess its efficacy, the performance of the ALMGD algorithm is scrutinized through a comparative analysis with the hill climbing and great deluge algorithms. As a result, the proposed algorithm can produce a solution that is superior to the comparison algorithm. The modified great deluge algorithm can reduce the penalty by 36%, while the hill climbing algorithm can only reduce the penalty by 29% and the great deluge algorithm reaches 34%.

Optimizing aircraft-gate reassignment following airport disruptions: A hierarchical column-and-row generation approach

Airport disruptions often pose challenges in assigning aircraft to gates, resulting in infeasible planned schedules. In particular, a large number of transfer passengers miss their connections in the context of disruptions, which cause huge economic losses to airlines and serious passengers’ dissatisfaction. This paper proposes a set-partitioning-based model to optimize Aircraft-Gate Reassignment with Transfer Passenger Connections (AGRP-TPC), which incorporates flexible gate-swap and aircraft-delay operations to mitigate the overall impact of disruptions. To efficiently solve the model, we introduce the concepts of additive-transfer and nonstop-transfer to handle passenger connections, and develop a Hierarchical Column-and-Row Generation (HCRG) approach guided by airport terminal space attribute. The column generation and row generation procedures solve iteratively until no new variables and constraints are generated. In addition, a follow-on strategy and a diving heuristic are designed to efficiently obtain high-quality solutions. We evaluate the proposed approach using various instances from a major Chinese international airport. Computational results demonstrate that our approach outperforms the comparison algorithms and produces good solutions within the time limit. Detailed results indicate that our approach effectively reduces overall losses in aircraft-gate reassignment following disruptions, and it can serve as an auxiliary decision-making tool for airport operators and airlines.

Modelling and Analysis of Smart Tourism Based on Deep Learning and Attention Mechanism

In the current traditional tourism recommendation systems, significant amounts of manpower and resources are required to manually identify the characteristics of resources, resulting in extremely poor economic benefits. To address this issue, this study proposes a smart tourism model based on deep learning and attention mechanisms. It uses a deep learning model to extract semantic information and improves it with the attention mechanism. This is to enable the model to take into account the complete meaning of the text and the association between individual words, thereby achieving a more comprehensive extraction of tourism resource features. The experiment showcases that the [Formula: see text]1-value of the algorithm proposed by us reached 0.961, the Recall value reached 0.958, the accuracy reached 0.980 and the area under the receiver operating characteristic curve reached 0.956. All parameters are superior to the comparison algorithm, and in practical application testing, its fitting degree reached 0.981. The above results indicate that the smart tourism proposed by us based on deep learning and attention mechanism has excellent performance in the field of tourism resource recommendation, which can effectively extract hidden features from the resources. This can also accurately push the tourism resources that users are interested in, which can effectively promote the integration and development of the tourism industry and the Internet, and has strong positive significance for economic development.

Industry Foundation Class-Based Building Information Modeling Lightweight Visualization Method for Steel Structures

The efficient extraction, storage, and visualization of geometric and semantic information is a key foundation for the operation of the building information modeling (BIM) platform. This study aims to develop a lightweight BIM system and optimize the system’s performance according to the specific characteristics of steel structures. This study proposes several novel techniques for extracting and decoupling the geometric and semantic information of components from industry foundation class (IFC) files. A redundancy removal approach combining the principal content analysis (PCA) algorithm and the Hausdorff-based comparison algorithm is proposed to identify standardized steel components, and a lightweight visualization method on Web3D for redundant instances is also presented. A loading mechanism of the level of detail (LOD) model based on a mesh simplification algorithm is presented to optimize the display efficiency. The developed system is evaluated by three steel structural models. Using the redundancy removal approach, the number of instances is decreased by 96.46% in less than 30 s and over 30 FPS (frame per second) is kept when rendering. Using the LOD loading mechanism, 95.38% of vertices and 98.46% of patches are eliminated under 50 mm precision. The experiment results indicate that users can quickly load large BIM models and fetch sufficient information from the website.

Beyond the Screen With DanceSculpt: A 3D Dancer Reconstruction and Tracking System for Learning Dance

Dance learning through online videos has gained popularity, but it presents challenges in providing comprehensive information and personalized feedback. This paper introduces DanceSculpt, a system that utilizes 3D human reconstruction and tracking technology to enhance the dance learning experience. DanceSculpt consists of a dancer viewer that reconstructs dancers in video into 3D avatars and a dance feedback tool that analyzes and compares the user’s performance with that of the reference dancer. We conducted a comparative study to investigate the effectiveness of DanceSculpt against conventional video-based learning. Participants’ dance performances were evaluated using a motion comparison algorithm that measured the temporal and spatial deviation between the users’ and reference dancers’ movements in terms of pose, trajectory, formation, and timing accuracy. Additionally, user experience was assessed through questionnaires and interviews, focusing on aspects such as effectiveness, usefulness, and satisfaction with the system. The results showed that participants using DanceSculpt achieved significant improvements in dance performance compared to those using conventional methods. Furthermore, the participants rated DanceSculpt highly in terms of effectiveness (avg. 4.27) and usefulness (avg. 4.17) for learning dance. The DanceSculpt system demonstrates the potential of leveraging 3D human reconstruction and tracking technology to provide a more informative and interactive dance learning experience. By offering detailed visual information, multiple viewpoints, and quantitative performance feedback, DanceSculpt addresses the limitations of traditional video-based learning and supports learners in effectively analyzing and improving their dance skills.

A multi-population multi-stage adaptive weighted large-scale multi-objective optimization algorithm framework

Weighted optimization framework (WOF) achieves variable dimensionality reduction by grouping variables and optimizing weights, playing an important role in large-scale multi-objective optimization problems. However, because of possible problems such as duplicate weight vectors in the selection process and loss of population diversity, the algorithm is susceptible to local optimization. Therefore, this paper develops an algorithm framework called multi-population multi-stage adaptive weighted optimization (MPSOF) to improve the performance of WOF in two aspects. First, the method of using multi-population is employed to address the issue of insufficient algorithmic diversity, while simultaneously reducing the likelihood of converging towards local optima. Secondly, a processing stage is incorporated into MPSOF, where a certain number of individuals are adaptively selected for updating based on the weight information and evolutionary status of different subpopulations, targeting different types of weights. This approach alleviates the impact of repetitive weights on the diversity of newly generated individuals, avoids the drawback of easily converging to local optima when using a single type of weight for updating, and effectively balances the diversity and convergence of subpopulations. Experiments of three types designed on several typical function sets demonstrate that MPSOF exceeds the comparison algorithms in the three metrics for Inverse Generation Distance, Hypervolume and Spacing.

An adaptive dual-strategy constrained optimization-based coevolutionary optimizer for high-dimensional feature selection

The feature subset obtained by traditional feature selection algorithms usually contains many irrelevant features and redundant features, which increases the size of the feature set and reduces classification accuracy. More importantly, these irrelevant features and redundant features may lead to local optimum. How to efficiently select the global optimal feature subset from high-dimensional data is a challenging task. To solve the problem, an adaptive dual-strategy constrained optimization-based coevolutionary optimizer for high-dimensional feature selection (ADSCO) is proposed in this paper. The contributions of this algorithm are as follows. Firstly, an adaptive dual strategy constrained optimization mechanism (ADSC) is developed. In the ADSC, the adaptive linear constraint strategy and the random constraint strategy are designed to search for the feature subsets that satisfy the constraints. This can reduce the search space of candidate solutions. Secondly, the dual population-constrained coevolutionary optimizer (CO) is developed to help the algorithm jump out of the local optimum and search for better optimal solutions to further improve the classification accuracy of ADSCO. Finally, the ablation experiments are executed to validate the effectiveness of the proposed ADSC and CO. The ADSCO algorithm is tested on 8 high-dimensional datasets and 8 low-dimensional datasets, and compared with seven typical population feature selection algorithms. Experimental results show that the proposed ADSCO algorithm is superior to the 7 comparison algorithms in terms of classification accuracy and feature subset size, demonstrating its strong competitiveness in tackling high-dimensional data feature selection.

Stability Analysis of Breakwater Armor Blocks Based on Deep Learning

This paper aims to use deep learning algorithms to identify and study the stability of breakwater armor blocks. It introduces a posture identification model for fender blocks using a Mask Region-based Convolutional Neural Network (R-CNN), which has been enhanced by considering factors affecting breakwater fender blocks. Furthermore, a wave prediction model for breakwaters is developed by integrating Bidirectional Encoder Representations from Transformers (BERTs) with Bidirectional Long Short-Term Memory (BiLSTM). The performance of these models is evaluated. The results show that the accuracy of the Mask R-CNN and its comparison algorithms initially increases and then decreases with higher Intersection Over Union (IOU) thresholds, peaking at 95.16% accuracy at an IOU threshold of 0.5. The BERT-BiLSTM wave prediction model maintains a loss value around 0.01 and an accuracy of approximately 90.00%. These results suggest that the proposed models offer more accurate stability assessments of breakwater armor blocks. By combining the random forest prediction model with BiLSTM, the wave characteristics and fender posture can be predicted better, offering reliable decision support for breakwater engineering.

A multi-strategy surrogate-assisted social learning particle swarm optimization for expensive optimization and applications

Evolutionary algorithms (EAs) require extensive fitness evaluations, which constitutes a barrier to solving computationally complex problems. In contrast, surrogate-assisted evolutionary algorithms (SAEAs) have the potential to solve complex expensive optimization problems. This paper proposes a surrogate-assisted social learning particle swarm optimization (SASLPSO) to handle expensive optimization problems. An adaptive local surrogate (ALS) strategy introduced in SASLPSO is introduced to accurately fit the landscape near the global optimum. ALS consists of two layers of surrogate, the part of the particles closest to the optimal particle and the closest to the optimal particle among the particles that have been eliminated historically. The proposed SASLPSO effectively combines global surrogate (GS) and adaptive local surrogate (ALS) to balance global exploration and local exploitation. Furthermore, a novel random group-based pre-screening (RGBPS) strategy is proposed to screen promising particles for real function evaluation. The proposed SASLPSO is compared with four other state-of-the-art SAEAs on 30D, 50D, and 100D benchmark functions. In addition, the significance of the SASLPSO algorithm was also verified using the Wilcoxon rank test. The test results on the benchmark function show that the SASLPSO algorithm performs better than other comparison algorithms, especially when dealing with high-dimensional benchmark functions. To further validate the effectiveness of the SASLPSO algorithm in solving expensive optimization problems, it was also applied to feature selection problems and real-world engineering problems. In addition, in the real application of node deployment in 3D wireless sensor networks, the highest coverage rate of the SASLPSO algorithm can reach 99.96%, confirming its performance advantages in solving real application problems. Finally, in the application of network intrusion detection, SASLPSO has shown more advantages in multiple metrics, proving its versatility.

LEFB: A new low-light image contrast enhancement algorithm

Low-light images are challenging for both human observation and computer vision algorithms due to low visibility. To address this issue, various image enhancement techniques such as dehazing, histogram equalization, and neural network-based methods have been proposed. However, most existing methods often suffer from the problems of insufficient contrast and over-enhancement while enhancing the brightness, which not only affects the visual quality of images but also adversely impacts their subsequent analysis and processing. To tackle these problems, this paper proposes a low-light image enhancement method called LEFB. Specifically, the low-light image is first transformed into the LAB color space, and the L channel controlling brightness is enhanced using a local contrast enhancement algorithm. Then, the enhanced image is further enhanced using an exposure fusion-based contrast enhancement algorithm, and finally, a bilateral filtering function is applied to reduce image edge blurriness. Experimental evaluations are conducted on real datasets with four comparison algorithms. The results demonstrate that the proposed method has superior performance in enhancing low-light images, effectively addressing problems of insufficient contrast and over-enhancement, while preserving fine details and texture information, resulting in more natural and realistic enhanced images.

Exploiting indirect linear correlation for label distribution learning

Label distribution learning represents the relevance of labels to samples using description degree, which can provide richer semantic information, thus finding wider applications. Exploiting label correlations is an effective approach to narrow down the hypothesis space of label distribution learning models. In existing works that utilize low-rank assumptions or label linear dependence to mine correlations, it is assumed that a label can be linearly expressed by other labels. However, this assumption can only be satisfied when there are linear dependency relationships between labels, thus the label correlation obtained by such methods is subject to certain distortion. To address this issue, this paper assumes that labels can be linearly represented by the same set of bases. The correlation between labels is represented by sharing common bases. Specifically, the paper employs matrix factorization to extract bases that can be used to represent all labels. And then designs a label distribution learning algorithm based on the property of sharing the same set of bases of the ground truth label distribution and predict label distribution. The effectiveness of the algorithm is verified through experimental validation. Generally speaking, the algorithm presented in this paper achieves optimal performance at 73.15% of the cases, with the best average ranking. In the two-tailed t-test, the algorithm in this paper exhibits statistical superiority compared to all comparison algorithms.

The application of curriculum recommendation algorithm in the driving mechanism of industry–teaching integration in colleges and universities under the background of education reform

Abstract At present, there is a poor connection between theory and practice in the driving mechanism of industry–teaching integration in colleges and universities. And with the increasing courses, the recommendation accuracy of the recommendation algorithm has also decreased. Therefore, the research built a teaching platform of the Internet of Things (IoT) based on the integration of industry and education and improved its internal online education course recommendation algorithm. Meanwhile, experiments verified its performance. The experimental results show that the response time of several important interfaces is maintained between 0 and 300 ms. In the verification experiment of the improved algorithm for building the rule engine, when the rules are 50, the traditional Rete algorithm takes the most time. In terms of total time consumption, the traditional Rete algorithm takes more time than the improved Rete algorithm. The mean absolute error of the User-Characteristics and Interest Clustering (CCIC) algorithm is 0.8116, the root mean square error is 0.9455, the accuracy is 0.3043, and the recall is 0.1475, which are better than the comparison algorithms. In the recommendation of actual agricultural courses, the overall satisfaction of the User-CCIC algorithm is more than 70%, with good prediction accuracy. In general, the IoT education platform based on the combination of industry and education established by this research has better application prospects, and the User-CCIC algorithm recommended by this research has a good practical effect in actual course recommendation.

Application of BIM model based on improved region growth algorithm in building reinforcement and renovation

In response to the current issue of poor modeling performance of Building Information Modeling for building models, a new Building Information Modeling based on an improved region growth algorithm is proposed. This method improves the region growth algorithm by introducing machine learning technology, and utilizes the improved algorithm to perfect the building model, thereby improving the efficiency of Building Information Modeling. The performance comparison experiment of the improved algorithm shows that its accuracy is 92.3%, respectively, which are lower than the comparison algorithm. Subsequent empirical analysis found that the robustness rating of the renovated building with the new Building Information Modeling was 94.06, significantly higher than the traditional model. The above results indicate that the new Building Information Modeling proposed in the study has high efficiency and accuracy in building reinforcement and renovation. This method can provide a new solution and idea for the field of building reinforcement and renovation.

A clustering mining method for sports behavior characteristics of athletes based on the ant colony optimization

This study aims to enhance the precision of analyzing athlete behavior characteristics, thereby optimizing sports training and competitive strategies. This study introduces an innovative Ant Colony Optimization (ACO) clustering model designed to address the high-dimensional clustering issues in athlete behavior data by simulating the path selection mechanism of ants searching for food. The development process of this model includes fine-tuning ACO parameters, optimizing for features specific to sports data, and comparing it with traditional clustering algorithms, and similar research models based on the neural network, support vector machines, and deep learning. The results indicate that the ACO model significantly outperforms the comparison algorithms in terms of silhouette coefficient (0.72) and Davies-Bouldin index (1.05), demonstrating higher clustering effectiveness and model stability. Particularly noteworthy is the recall rate (0.82), a key performance indicator, where the ACO model accurately captures different behavioral characteristics of athletes, validating its effectiveness and reliability in athlete behavior analysis. The innovation lies not only in the application of the ACO algorithm to address practical issues in the field of sports but also in showcasing the advantages of the ACO algorithm in handling complex, high-dimensional sports data. However, its generality and efficiency on a larger scale or different types of sports data still need further validation. In conclusion, through the introduction and optimization of the ACO clustering model, this study provides a novel and effective approach for a deeper understanding and analysis of athlete behavior characteristics. This study holds significant importance in advancing sports science research and practical applications.