Ant Colony Optimization Research Articles

Quantum-Fuzzy Expert Timeframe Predictor for Post-TAVR Monitoring

This paper presents a novel approach to predicting specific monitoring timeframes for Permanent Pacemaker Implantation (PPMI) requirements following a Transcatheter Aortic Valve Replacement (TAVR). The method combines Quantum Ant Colony Optimization (QACO) with the Adaptive Neuro-Fuzzy Inference System (ANFIS) and incorporates expert knowledge. Although this forecast is more precise, it requires a larger number of predictors to achieve this level of accuracy. Our model deploys expert-derived insights to guarantee the clinical relevance and interpretability of the predicted outcomes. Additionally, we employ quantum computing techniques to address this complex and high-dimensional problem. Through extensive assessments, we show that our quantum-enhanced model outperforms traditional methods with notable improvement in evaluation metrics, such as accuracy, precision, recall, and F1 score. Furthermore, with the integration of eXplainable AI (XAI) methods, our solution enhances the transparency and reliability of medical predictive models, hence promoting improved clinical practice decision-making. The findings highlight how quantum computing has the potential to completely transform predictive analytics in the medical field, especially when it comes to improving patient care after TAVR.

Optimizing protein content prediction in rice bean (Vigna umbellata L.) by integrating near-infrared reflectance spectroscopy, MPLS, deep learning, and key wavelengths selection algorithms

Rice bean, a potential protein-rich underutilized crop, can serve as a valuable source for food and feed, contributing to sustainable food and nutrition security. However, traditional methods for measuring protein content are laborious, tedious, and expensive. This study evaluates the performance of Modified Partial Least Squares (MPLS) and 1D Convolutional Neural Network (1D CNN) models in predicting protein content in rice bean using Near-Infrared Reflectance Spectroscopy (NIRS) data. Both models were validated with whole spectra, key wavelengths, and spectral segments derived from Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), and Competitive Adaptive Reweighted Sampling (CARS). The 1D CNN model demonstrated superior predictive performance, with an 11 % increase in R² and an 18 % increase in RPD using the whole spectra compared to the MPLS model. Specifically, the 1D CNN model with CARS-selected wavelengths achieved an R² of 0.82 and an RPD of 2.15, while the MPLS model achieved an R² of 0.84 and an RPD of 2.25. The segmented spectra approach further enhanced the 1D CNN model's performance, achieving the highest R² of 0.84 and an RPD of 2.28 with CARS-selected segments. These results highlight that the 1D CNN model with CARS-selected wavelengths provides the best predictive performance for protein content in rice bean. The optimized method can lead to rapid early-phase breeding practices and improved quality assessments in leguminous crops, emphasizing the importance of integrating advanced modeling techniques with NIRS for agricultural applications.

An interaction-enhanced co-evolutionary algorithm for electric vehicle routing optimization

Recently, the electric vehicle routing problem (EVRP) has emerged as a significant challenge in the transportation field. Unlike traditional vehicle routing problems, EVRP requires optimizing not only the customer route but also the charging scheme. This implies that routes must be planned while considering the availability of charging stations, and charging decisions must be made based on the specific route structure. Although the dual-population-based co-evolutionary algorithm (DPCA) has been proposed to address this coupling relationship, there is still room for further performance improvement. Therefore, this paper proposes an interaction-enhanced co-evolutionary algorithm (IECA) that facilitates a more effective collaborative search between routing and charging optimizations. For routing optimization, we propose an improved ant colony optimization method with a novel pheromone update approach to generate diverse route solutions. Specifically, we utilize information from the charging population to guide the pheromone update process. In contrast to DPCA, which solely relies on the best solution, we establish interaction among multiple solutions from both the routing and charging populations, which can better contribute the information interaction between two populations. Furthermore, we devise a novel population update strategy that enhances the selection of promising solutions. Experimental results validate the effectiveness of the proposed algorithm by demonstrating its ability to avoid local optima. Moreover, it achieves a reduction of approximately 4% in the average route distance across two public test suites. The source code is available at https://github.com/ShouLiang-Z/IECA.

Logistics Routing Intelligence based on Improved Ant Colony Algorithm and Dijkstra Algorithm

Logistics Routing Intelligence based on Improved Ant Colony Algorithm and Dijkstra Algorithm

Surveillance Unmanned Ground Vehicle Path Planning with Path Smoothing and Vehicle Breakdown Recovery

As unmanned ground vehicles (UGV) continue to be adapted to new applications, an emerging area lacks proper guidance for global route optimization methodology. This area is surveillance. In autonomous surveillance applications, a UGV is equipped with a sensor that receives data within a specific range from the vehicle while it traverses the environment. In this paper, the ant colony optimization (ACO) algorithm was adapted to the UGV surveillance problem to solve for optimal paths within sub-areas. To do so, the problem was modeled as the covering salesman problem (CSP). This is one of the first applications using ACO to solve the CSP. Then, a genetic algorithm (GA) was used to schedule a fleet of UGVs to scan several sub-areas such that the total distance is minimized. Initially, these paths are infeasible because of the sharp turning angles. Thus, they are improved using two methods of path refinement (namely, the corner-cutting and Reeds–Shepp methods) such that the kinematic constraints of the vehicles are met. Several test case scenarios were developed for Goheung, South Korea, to validate the proposed methodology. The promising results presented in this article highlight the effectiveness of the proposed methodology for UGV surveillance applications.

Improving Software Defect Prediction With a Combination of Feature Selection Based On Ant Colony Optimization and Ensemble Technique

Software defect prediction plays a vital role in enhancing software quality and minimizing maintenance costs. This study aims to improve software defect prediction by employing a combination of Ant Colony Optimization (ACO) for feature selection and ensemble techniques, particularly Gradient Boosting. The research utilizes three NASA MDP datasets: MC1, KC1, and PC2, to evaluate the performance of four machine learning algorithms: Random Forest, Support Vector Machine (SVM), Decision Tree, and Naïve Bayes. Data preprocessing involved handling class imbalances using the SMOTE technique and transforming categorical data into numerical representations. The results indicate that the integration of ACO and Gradient Boosting significantly enhances the accuracy of all four algorithms. Notably, the Random Forest algorithm achieved the highest accuracy of 99% on the MC1 dataset. The findings suggest that combining ACO-based feature selection with ensemble techniques can effectively boost the performance of software defect prediction models, offering a robust approach for early detection of potential softwaredefects and contributing to improved software reliability and efficiency.

Grabbing Path Extraction of Deep-Sea Manganese Nodules Based on Improved YOLOv5

In an effort to enhance the efficiency and accuracy of deep-sea manganese nodule grasping behavior by a manipulator, a novel approach employing an improved YOLOv5 algorithm is proposed for the extraction of the shortest paths to manganese nodules targeted by the manipulator. The loss function of YOLOv5s has been improved by integrating a dual loss function that combines IoU and NWD, resulting in better accuracy for loss calculations across different target sizes. Additionally, substituting the initial C3 module in the network backbone with a C2f module is intended to improve the flow of gradient information while reducing computational demands. Once the geometric center of the manganese nodules is identified with the improved YOLOv5 algorithm, the next step involves planning the most efficient route for the manipulator to pick up the nodules using an upgraded elite strategy ant colony algorithm. Enhancements to the ACO algorithm consist of implementing an elite strategy and progressively decreasing the number of ants in each round. This method reduces both the number of iterations and the time required for each iteration, while also preventing the occurrence of local optimal solutions. The experimental findings indicate that the improved YOLOv5s detection algorithm boosts detection accuracy by 2.3%. Furthermore, when there are fewer than 30 target planning points, the improved algorithm requires, on average, 24% fewer iterations than the ACO algorithm to determine the shortest path. Additionally, the speed of calculation for each iteration is quicker while still providing the optimal solution.

An improved network dismantling strategy based on ant colony algorithm

An improved network dismantling strategy based on ant colony algorithm

A multi-period restoration approach for resilience increase of active distribution networks by considering fault rapid recovery and component repair

As the frequency of extreme weather events continues to rise, there is an urgent need to strengthen the safe and stable operation of active distribution networks (ADNs), and it is of great value to establish highly resilient ADNs to withstand multi-faults caused by extreme weather events. This paper proposes a multi-period restoration approach for the resilience increase of ADNs by considering fault rapid recovery and component repair under typhoon disasters. Firstly, based on the structural reliability theory, the failure rate model of the main components is established, and in light of the system information entropy, the typical fault scenario selection strategy is designed to determine the branches with high fault probability. Then, according to the fault islanding division and network reconfiguration, a fault rapid recovery method is suggested for the ADNs, where the impact of typhoon disasters on the output features of distributed generators (DGs) are taken into account, and meanwhile, the network structure and the output power of the DGs are jointly optimized to minimize the operating cost of the ADNs. Further, a fault component repair model is formulated by adopting the adaptive ant colony algorithm, and a multi-period restoration approach is proposed for the ADNs to fulfill a rolling optimization of the network reconfiguration and fault component repair. The improved IEEE 33-node and IEEE 118-node systems are used for the approach verification, and the results show that the proposed approach can effectively improve the overall load restoration level and increase the component repair efficiency. Following a multi-criteria resilience evaluation system, the proposed approach enables the ADNs to more effectively withstand typhoon disasters, offering a resilience increase of 6.93 % and 32.24 % regarding the 33-node and 118-node systems.

Research on Modeling Method for Optimal Allocation of Wellhead Targets in Large Well Clusters

The paper proposes a genetic ant colony algorithm that integrates genetic and ant colony algorithms, enhancing the heuristic function of the latter, to address target point distribution issues in large well clusters. This algorithm utilizes genetic algorithms for initial pheromone distribution and employs the ant colony algorithm to achieve rapid convergence. Introducing genetic operators in each iteration addresses the ant colony system’s drawbacks, including scarcity of initial pheromones, susceptibility to local optima, and slow convergence speed. The model aims to minimize the sum of horizontal displacement and intersections in line connections from wellheads to target points as its dual-objective function. It validates the effectiveness of the genetic ACO algorithm in optimizing target point allocation at wellheads through a case study, highlighting its advantages over traditional methods in reducing displacement, ensuring result stability, and preventing collisions.

An Improved Ant Colony Algorithm with Deep Reinforcement Learning for the Robust Multiobjective AGV Routing Problem in Assembly Workshops

Vehicle routing problems (VRPs) are challenging problems. Many variants of the VRP have been proposed. However, few studies on VRP have combined robustness and just-in-time (JIT) requirements with uncertainty. To solve the problem, this paper proposes the just-in-time-based robust multiobjective vehicle routing problem with time windows (JIT-RMOVRPTW) for the assembly workshop. Based on the conflict between uncertain time and JIT requirements, a JIT strategy was proposed. To measure the robustness of the solution, a metric was designed as the objective. Afterwards, a two-stage nondominated sorting ant colony algorithm with deep reinforcement learning (NSACOWDRL) was proposed. In stage I, ACO combines with NSGA-III to obtain the Pareto frontier. Based on the model, a pheromone update strategy and a transfer probability formula were designed. DDQN was introduced as a local search algorithm which trains networks through Pareto solutions to participate in probabilistic selection and nondominated sorting. In stage II, the Pareto frontier was quantified in feasibility by Monte Carlo simulation, and tested by diversity-robust selection based on uniformly distributed weights in the solution space to select robust Pareto solutions that take diversity into account. The effectiveness of NSACOWDRL was demonstrated through comparative experiments with other algorithms on instances. The impact of JIT strategy is analyzed and the effect of networks on the NSACOWDRL is further discussed.

Optimization method for collision avoidance paths of inland ships based on improved ant colony algorithm

Optimization method for collision avoidance paths of inland ships based on improved ant colony algorithm

A practical path planning method for optimal repair paths between multiple small-size defects

Purpose This study aims to solve the problem of repair path planning between multiple small-size defects in the field of additive manufacturing (AM) repair by using Python-based ant colony algorithm (ACO). The optimal parameter combination scheme is obtained by discussing the influencing factors of parameters in the ACO. Design/methodology/approach The effects of the information heuristic factor α, the expected heuristic factor ß and the pheromone volatile factor ρ on the simulation results were investigated by designing a three-factor and three-level orthogonal experiment. The fast convergence of ACO in finding the optimal solution of multiple small-size defect repair path problem is proved by comparing the simulation results with those of genetic algorithm (GA) on the same data set. Findings The ACO can effectively solve the repair path planning problem between multiple small-size defects by optimizing the parameters. In the case of 50 defect locations, the simulation results of the ACO with optimized parameters are 159.8 iterations and 3,688 average path lengths, while the GA has 4,027.2 average path lengths under the same data set and the same number of iterations, and by comparison, it is proved that the ACO can find the optimal solution quickly in the small-size defects repair path planning problem, which greatly improves the efficiency of defect repair. Originality/value The parameter-optimized ACO can be quickly applied to the planning problem of repair paths between multiple small-size defects in the field of AM repair, which can better improve the defect repair efficiency and reduce the waste of resources.

Analysis of Wireless Security and Networks using COPRAS Method

The wireless networks have become integral to our daily lives, powering everything from smart phones to smart home devices. However, alongside their benefits, wireless networks also bring forth significant security challenges. Wireless networks, unlike traditional wired networks, transmit data over the airwaves, making them susceptible to various forms of unauthorized access and data breaches. Ensuring the security of these networks is crucial to safeguard sensitive information, protect user privacy, and prevent cyber-attacks. The significance of research in wireless security and networks lies in the critical role that wireless technologies play in our interconnected world. As wireless networks become increasingly prevalent in various sectors, including communication, commerce, healthcare, transportation, and more, ensuring their security becomes paramount. Research in wireless security and networks contributes to the advancement of secure and reliable wireless technologies, protecting users' privacy, data, and overall well-being in an increasingly connected world. The COPRAS-G method requires identifying selection criteria, evaluating information related to these criteria, and developing methods to evaluate Meeting the participant's needs Criteria for doing in order to assess the overall performance of the surrogate. Decision analysis involves a Decision Maker (DM) Situation to do consider a particular set of alternatives and select one among several alternatives, usually with conflicting criteria. For this reason, the developed complexity proportionality assessment (COPRAS) method can be used. A genetic algorithm; Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Differential Evolution (DE). Detection Accuracy, Resource Efficiency; Implementation Complexity; Time-to-Deployment. From the result Differential Evolution (DE) is got the first rank whereas is Ant Colony Optimization (ACO) is having the lowest rank

Novel hybrid XGBoost-based soft computing models for predicting penetration resistance of buried pipelines in cohesive soils

In this paper, both the finite element limit analysis (FELA) and soft computing techniques of four hybrid XGBoost (XGB) models, namely, GA-XGB, optimized with Genetic Algorithms; SMA-XGB, optimized with Slime Mould Algorithms; PSO-XGB, optimized with Particle Swarm Optimization; ACO-XGB, Ant Colony Optimization; and one Genetic Programing model (GP), are employed to develop surrogate models for predicting the undrained penetration resistance of buried pipelines embedded in clays. The penetration resistance of pipelines is caused by internal and external pressures, resulting in a force that acts on the pipeline in the downward and inclined directions at the same time. The penetration resistance factor (N) of a buried pipeline is determined based on four dimensionless variables, namely, the buried depth ratio (H/D), the inclination angle of the applied load (β), the soil strength or overburden ratio (γH/c), and the adhesion factor at soil-pipeline interfaces (α). The findings of this study are presented and summarized in the form of charts for dimensionless penetration resistance factors (N) and failure mechanisms of pipelines. Furthermore, the results from this study are compared with the results from previous studies and agrees well with those of previous studies. According to the results of the four developed hybrid XGBoost-based models, SMA-XGB outperforms GA-XGB, PSO-XGB, and ACO-XGB with no symptoms of overfitting, while the GP model resulted in an adequately accurate model with the advantage of a closed-form equation; its determination correlation coefficient of training and testing equals 0.98 (R2 = 0.980).

Retraction Note: A metaheuristic optimization model for spectral allocation in cognitive networks based on ant colony algorithm (M-ACO)

Retraction Note: A metaheuristic optimization model for spectral allocation in cognitive networks based on ant colony algorithm (M-ACO)

Enhancing students performance through dynamic personalized learning path using ant colony and item response theory (ACOIRT)

Generating personalized learning paths (PLP) tailored to each student's characteristics and abilities is challenging, especially when using multiple-choice test scores to predict knowledge levels, which can be affected by guessing. We combined the ant colony algorithm (ACO) with Item Response Theory (IRT) to address this issue. This method models the relationship between student responses and their latent abilities, to improve the prediction of knowledge levels resulting in more accurate personalized learning paths (PLP). The parameters used to create the PLP include the initial module, targeted module, knowledge level, pretest score, and difficulty level. The difficulty level is required to ensure the learning object aligns with the student's abilities. Additionally, the system retains a dynamic personalized learning path that accommodates changes in the student's abilities in each module. We divided 80 students into Group X (using ACOPLP) and Group Y (using ACOIRT), each with 40 students. We conducted a pretest and posttest on both groups in order to analyze the effects of implementing the PLP system. Group X outperformed Group Y on the pretest, however, Group Y surpassed Group X on the posttest, with score enhancements ranging from 60.8% to 127.8%. The statistical analysis revealed a noteworthy enhancement in performance for Group Y, with a p-value of 0.002. These results indicate that ACOIRT has the potential for improved student's performance.

Diverse but Relevant Recommendations with Continuous Ant Colony Optimization

Diverse but Relevant Recommendations with Continuous Ant Colony Optimization

Three-Dimensional Obstacle Avoidance Harvesting Path Planning Method for Apple-Harvesting Robot Based on Improved Ant Colony Algorithm

The cultivation model for spindle-shaped apple trees is widely used in modern standard apple orchards worldwide and represents the direction of modern apple industry development. However, without an effective obstacle avoidance path, the robotic arm is prone to collision with obstacles such as fruit tree branches during the picking process, which may damage fruits and branches and even affect the healthy growth of fruit trees. To address the above issues, a three-dimensional path -planning algorithm for full-field fruit obstacle avoidance harvesting for spindle-shaped fruit trees, which are widely planted in modern apple orchards, is proposed in this study. Firstly, based on three typical tree structures of spindle-shaped apple trees (free spindle, high spindle, and slender spindle), a three-dimensional spatial model of fruit tree branches was established. Secondly, based on the grid environment representation method, an obstacle map of the apple tree model was established. Then, the initial pheromones were improved by non-uniform distribution on the basis of the original ant colony algorithm. Furthermore, the updating rules of pheromones were improved, and a biomimetic optimization mechanism was integrated with the beetle antenna algorithm to improve the speed and stability of path searching. Finally, the planned path was smoothed using a cubic B-spline curve to make the path smoother and avoid unnecessary pauses or turns during the harvesting process of the robotic arm. Based on the proposed improved ACO algorithm (ant colony optimization algorithm), obstacle avoidance 3D path planning simulation experiments were conducted for three types of spindle-shaped apple trees. The results showed that the success rates of obstacle avoidance path planning were higher than 96%, 86%, and 92% for free-spindle-shaped, high-spindle-shaped, and slender-spindle-shaped trees, respectively. Compared with traditional ant colony algorithms, the average planning time was decreased by 49.38%, 46.33%, and 51.03%, respectively. The proposed improved algorithm can effectively achieve three-dimensional path planning for obstacle avoidance picking, thereby providing technical support for the development of intelligent apple picking robots.

Research on Automatic PCB Routing Strategy based on Ant Colony Algorithm

Research on Automatic PCB Routing Strategy based on Ant Colony Algorithm