Search Results (308)

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. Full article

This paper introduces a novel method called AcoRec, which employs an enhanced version of Continuous Ant Colony Optimization for hyper-parameter adjustment and integrates a non-deterministic model to generate diverse recommendation lists. AcoRec is designed for cold-start users and long-tail item recommendations by leveraging implicit data from collaborative filtering techniques. Continuous Ant Colony Optimization is revisited with the convenience and flexibility of deep learning solid methods and extended within the AcoRec model. The approach computes stochastic variations of item probability values based on the initial predictions derived from a selected item-similarity model. The structure of the AcoRec model enables efficient handling of high-dimensional data while maintaining an effective balance between diversity and high recall, leading to recommendation lists that are both varied and highly relevant to user tastes. Our results demonstrate that AcoRec outperforms existing state-of-the-art methods, including two random-walk models, a graph-based approach, a well-known vanilla autoencoder model, an ACO-based model, and baseline models with related similarity measures, across various evaluation scenarios. These evaluations employ well-known metrics to assess the quality of top-N recommendation lists, using popular datasets including MovieLens, Pinterest, and Netflix. Full article

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. Full article

This article presents an in-depth analysis of three advanced strategies to tune fractional PID (FOPID) controllers for a nonlinear system of interconnected tanks, simulated using MATLAB. The study focuses on evaluating the performance characteristics of system responses controlled by FOPID controllers tuned through three heuristic algorithms: Ant Colony Optimization (ACO), Grey Wolf Optimizer (GWO), and Flower Pollination Algorithm (FPA). Each algorithm aims to minimize its respective cost function using various performance metrics. The nonlinear model was linearized around an equilibrium point using Taylor Series expansion and Laplace transforms to facilitate control. The FPA algorithm performed better with the lowest Integral Square Error (ISE) criterion value ($297.83$) and faster convergence in constant values and fractional orders. This comprehensive evaluation underscores the importance of selecting the appropriate tuning strategy and performance index, demonstrating that the FPA provides the most efficient and robust tuning for FOPID controllers in nonlinear systems. The results highlight the efficacy of meta-heuristic algorithms in optimizing complex control systems, providing valuable insights for future research and practical applications, thereby contributing to the advancement of control systems engineering. Full article

Water is an irreplaceable commodity with a high economic value. Today, water scarcity is the biggest challenge in the world, and the crises arising from lack of freshwater resources are serious threats to sustainable environmental development and human health and welfare. As the problems grow in complexity and dimensions, it becomes less possible to solve them with conventional optimization methods or explicit computational methods in a proper amount of time and with the currently limited computation memory, making it very difficult to achieve an optimal absolute solution. In this regard, metaheuristic algorithms that are generally inspired by nature are used in complex optimization problems. The Pishin Dam is an important dam in the eastern basin of Iran in the south of Sistan and Baluchestan province. This region faces severe water stress due to very low precipitation and very high evaporation on the one hand and the growing increase in urban, agricultural, and industrial demand on the other hand. The water development plans executed by the Ministry of Energy in the studied region influence water supply and demand profoundly. This research investigated the optimal allocation of water resources of this dam under management scenarios using the metaheuristic technique of the ant colony optimization algorithm (ACO). The results showed that the best value of the objective function was 82.3658 million m³. When applying the scenario of developing the cultivation area, the best value was obtained at 67.1258, which was significantly different from the base state. The results show that the ACO algorithm is suitable for the water resources of the Pishin Dam and can be used in planning and policymaking. Full article

The hot rolled strip is a basic industrial product whose surface quality is of utmost importance. The condition of hot rolling work rolls that have been worn for a long time is the key factor. However, the traditional scheduling method controls risks to the surface quality by setting fixed rolling length limits and penalty scores, ignoring the wear condition differences caused by various products. This paper addresses this limitation by reconstructing a hot rolling-scheduling model, after developing a model for pre-assessment of the risk to surface quality based on the Weibull failure function, the deformation resistance formula, and real production data from a rolling plant. Additionally, Ant Colony Optimization (referred to as ACO) is employed to implement the scheduling model. The simulation results of the experiments demonstrate that, compared to the original scheduling method, the proposed one significantly reduces the cumulative risk of surface defects on products. This highlights the efficacy of the proposed method in improving scheduling decisions and surface quality of hot rolled strips. Full article

The rapid advancement of deepfake technology presents significant challenges in detecting highly convincing fake videos, posing risks such as misinformation, identity theft, and privacy violations. In response, this paper proposes an innovative approach to deepfake video detection by integrating features derived from ant colony optimization–particle swarm optimization (ACO-PSO) and deep learning techniques. The proposed methodology leverages ACO-PSO features and deep learning models to enhance detection accuracy and robustness. Features from ACO-PSO are extracted from the spatial and temporal characteristics of video frames, capturing subtle patterns indicative of deepfake manipulation. These features are then used to train a deep learning classifier to automatically distinguish between authentic and deepfake videos. Extensive experiments using comparative datasets demonstrate the superiority of the proposed method in terms of detection accuracy, robustness to manipulation techniques, and generalization to unseen data. The computational efficiency of the approach is also analyzed, highlighting its practical feasibility for real-time applications. The findings revealed that the proposed method achieved an accuracy of 98.91% and an F1 score of 99.12%, indicating remarkable success in deepfake detection. The integration of ACO-PSO features and deep learning enables comprehensive analysis, bolstering precision and resilience in detecting deepfake content. This approach addresses the challenges involved in facial forgery detection and contributes to safeguarding digital media integrity amid misinformation and manipulation. Full article

This study explores the feasibility of using impedance relays in electrical distribution systems, a context where their application is not as common as in transmission systems. Given the dynamic nature and complex topology of medium-voltage distribution systems, this work proposes an innovative methodology integrating clustering algorithms and metaheuristic techniques to optimize the placement of impedance relays and enhance system reliability and resilience. Using CYME simulation and the Ant Colony Optimization (ACO) method, case studies were designed to validate the effectiveness of the proposed methodology. The results demonstrated that strategic placement of impedance relays reduces failure frequency and significantly improves the system’s response to such failures. This approach allows for a more efficient configuration and quicker response, which is crucial for maintaining continuity and quality of power supply. A detailed analysis of system behavior under various fault scenarios illustrates the robustness and adaptability of the proposed solution, marking a significant advancement in the protection and optimization of electrical distribution systems. Full article

Diverse demands have promoted the rapid development of the cold chain logistics industry. In the paper, a novel approach for calculating the comprehensive carbon emission cost was proposed and the front warehouse mode was analyzed under the background of energy conservation and emission reduction. To solve the two-echelon low-carbon location-routing problem (2E-LCLRP), a mathematical model considering operating cost, total transportation cost, fixed cost, refrigeration cost, cargo damage cost, and comprehensive carbon emission cost was proposed to determine the minimum total cost. A hybrid ant colony optimization (HACO) algorithm based on an elbow rule and an improved ant colony optimization (IACO) algorithm was proposed to solve the 2E-LCLRP. According to the elbow rule, the optimal number of front warehouses was determined and an IACO algorithm was then designed to optimize vehicle routes. An adaptive hybrid selection strategy and an optimized pheromone update mechanism were integrated into the HACO algorithm to accelerate convergence and obtain global optimal solutions. The proposed model and algorithm were verified through the case study of the 2E-LCLRP in Nanjing, China. The HACO algorithm outperformed the original ant colony optimization (ACO) algorithm in terms of convergence rate and solution quality. This study provides significant insights for enhancing heuristic algorithms as well as valuable research methods. Furthermore, the results can help cold chain logistics companies in balancing economic costs and environmental benefits and address cold chain distribution of agricultural products. Full article

This paper proposes a flexible travel recommender model (FTRM) that emphasizes the symmetry between user preferences and travel constraints, addressing key challenges in the field such as the integration of diverse constraint types and the customization of travel itineraries. The key contribution of the proposed model lies in its integration with the item constraints data model (ICDM), which effectively manages a plethora of constraint types. Additionally, this study develops a novel algorithm inspired by ant colony optimization (ACO) principles, demonstrating performance metrics that are comparable to state-of-the-art algorithms in this field. A comprehensive set of systematic experimental analyses is conducted, employing various models across diverse situational contexts, with the primary goal of illustrating the capabilities of the proposed symmetrical FTRM using real-world data from the Durham dataset. The obtained results highlight the model’s ability to accommodate diverse constraint types, facilitating the customization of travel itineraries to suit individual user preferences and achieve a balanced and symmetrical travel experience. Specifically, our model outperforms existing models in terms of flexibility and customization, showing significant improvements in user satisfaction and itinerary efficiency. Full article

Apples are usually bagged during the growing process, which can effectively improve the quality. Establishing an in situ nondestructive testing model for in-tree apples is very important for fruit companies in selecting raw apple materials for valuation. Low-maturity apples and high-maturity apples were acquired separately by a handheld tester for the internal quality assessment of apples developed by our group, and the effects of the two maturity levels on the soluble solids content (SSC) detection of apples were compared. Four feature selection algorithms, like ant colony optimization (ACO), were used to reduce the spectral complexity and improve the apple SSC detection accuracy. The comparison showed that the diffuse reflectance spectra of high-maturity apples better reflected the internal SSC information of the apples. The diffuse reflectance spectra of the high-maturity apples combined with the ACO algorithm achieved the best results for SSC prediction, with a prediction correlation coefficient (Rp) of 0.88, a root mean square error of prediction (RMSEP) of 0.5678 °Brix, and a residual prediction deviation (RPD) value of 2.466. Additionally, the fruit maturity was predicted using PLS-LDA based on color data, achieveing accuracies of 99.03% and 99.35% for low- and high-maturity fruits, respectively. These results suggest that in-tree apple in situ detection has great potential to enable improved robustness and accuracy in modeling apple quality. Full article

In current traffic congestion scenarios, electric vehicles (EVs) have the problem of reduced battery life and continuous decline in endurance. Therefore, this study proposes an optimization method for electric vehicle charging scheduling based onthe ant colony optimization algorithm with adaptive dynamic search (ADS-ACO), and conducts experimental verification on it. The experiment revealed that in the four benchmark functions, the research algorithm has the fastest convergence speed and can achieve convergence in most of them. In the validation of effectiveness, the optimal solution for vehicle time consumption under the ADS-ACO algorithm in the output of the algorithm with a stationary period and a remaining battery energy of 15 kW·h was 2.146 h in the regular road network. In the initial results of 15 kW·h under changes in road conditions from peak to peak periods, the total energy consumption of vehicles under the research algorithm was 4.678 kW·h and 4.656 kW·h under regular and irregular road networks, respectively. The change results were 4.509 kW·h and 4.656 kW·h, respectively. The initial results of 10 kW·h were 4.755 kW·h and 4.873 kW·h, respectively. The change results were 4.461 kW·h and 4.656 kW·h, respectively, which are lower than the comparison algorithm. In stability verification, research algorithms can find the optimal path under any conditions. The algorithm proposed in the study has been demonstrated to be highly effective and stable in electric vehicle charging path planning. It represents a novel solution for electric vehicle charging management and is expected to significantly enhance the range of electric vehicles in practical applications. Full article

Effective control of the micro- and nanostructure of thermal barrier coatings is essential to enhance the thermal radiation performance of the coating, which helps to determine the remaining service life of the coating. This paper proposed a method to measure the radiation properties of thermal barrier coatings by terahertz nondestructive testing technique, using APS-prepared thermal barrier coatings as the object of study. Radiative properties were a comprehensive set of properties characterized by the diffuse reflectance, transmittance, and absorptance of the thermal barrier coating. The coating data in actual service were obtained by scanning electron microscopy and metallographic experiments, and the data were used as the simulation model critical value. The terahertz time-domain simulation data of coatings with different microstructural features were obtained using the finite-different time-domain (FDTD) method. In simulating the real test signals, white noise with a signal-to-noise ratio of 20 dB was added, and fast Fourier transform (FFT), short-time Fourier transform (STFT), and wavelet transform (WT) were used to reduce the noise and compare their noise reduction effects. Different machine learning methods were used to build the model, including support vector machine algorithm (SVM) and k-nearest neighbor algorithm (KNN). The principal component algorithm (PCA) was used to reduce the dimensionality of terahertz time-domain data, and the SVM algorithm and KNN algorithm were optimized using the particle swarm optimization algorithm (PSO) and the ant colony optimization algorithm (ACO), respectively, to improve the robustness of the system. The K-fold cross-validation method was used to construct the model to improve the adaptability of the model. It could be clearly seen that the novel hybrid PCA-ACO-SVM model had superior prediction performance. Finally, this work proposed a novel, convenient, nondestructive, online, safe and highly accurate method for measuring the radiation performance of thermal barrier coatings, which could be used for the judgment of the service life of thermal barrier coatings. Full article

Continuous advancements in GNSS systems have led, apart from the broadly used GPS, to the development of other satellite systems (Galileo, BeiDou, GLONASS), which have significantly increased the number of available satellites for GNSS positioning applications. However, despite GNSS satellites’ redundancy, a potential poor GNSS satellite signal (i.e., low signal-to-noise ratio) can negatively affect the GNSS’s performance and positioning accuracy. On the other hand, selecting high-quality GNSS satellite signals by retaining a sufficient number of GNSS satellites can enhance the GNSS’s positioning performance. Various methods, including optimization algorithms, which are also commonly adopted in artificial intelligence (AI) methods, have been applied for satellite selection. In this study, five optimization algorithms were investigated and assessed in terms of their ability to determine the optimal GNSS satellite constellation, such as Artificial Bee Colony optimization (ABC), Ant Colony Optimization (ACO), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Simulated Annealing (SA). The assessment of the optimization algorithms was based on two criteria, such as the robustness of the solution for the optimal satellite constellation and the time required to find the solution. The selection of the GNSS satellites was based on the weighted geometric dilution of precision (WGDOP) parameter, where the geometric dilution of precision (GDOP) is modified by applying weights based on the quality of the satellites’ signal. The optimization algorithms were tested on the basis of 24 h of tracking data gathered from a permanent GNSS station, for GPS-only and multi-GNSS data (GPS, GLONASS, and Galileo). According to the comparison results, the ABC, ACO, and PSO algorithms were equivalent in terms of selection accuracy and speed. However, ABC was determined to be the most suitable algorithm due it requiring the fewest number of parameters to be set. To further investigate ABC’s performance, the method was applied for the selection of an optimal GNSS satellite subset according to the number of total available tracked GNSS satellites (up to 31 satellites), leading to more than 300 million possible combinations of 15 GNSS satellites. ABC was able to select the optimal satellite subsets with 100% accuracy. Full article

To improve the workshop production efficiency of textile enterprises and balance the total operating time of all machines in each operation, this paper proposes a modified algorithm based on the combination of the ant colony optimization (ACO) algorithm and production products, which we call the product ant colony optimization (PACO) algorithm. The local pheromone update rule in the ACO algorithm is modified through the close relationship between textile machinery and production products in the textile workshop; the pheromone is then introduced into production products based on the constraints of the textile machine. A heuristic function is designed to improve the utilization rate of textile machines to increase the heuristic value of machines that are less frequently used in the algorithm iteration process. In addition, this paper combines the convergence speed and the global search ability of the algorithm with a designed variable pheromone evaporate parameter. The comparison among the initially designed PACO algorithm, the separately modified PACO algorithm, and the integratively modified PACO algorithm demonstrates that the proposed enhancement effectively addresses scheduling issues in textile flexible workshops and various workshops with similar constraint conditions. Full article