Improved traditional ant colony algorithms,a data routing model used to the data remote exchange on WAN was presented.In the model,random heuristic factors were introduced to realize multi-path search.The updating mod...Improved traditional ant colony algorithms,a data routing model used to the data remote exchange on WAN was presented.In the model,random heuristic factors were introduced to realize multi-path search.The updating model of pheromone could adjust the pheromone concentration on the optimal path according to path load dynamically to make the system keep load balance.The simulation results show that the improved model has a higher performance on convergence and load balance.展开更多
As electro-hydrostatic actuator(EHA)technology advances towards lightweight and integration,the demand for enhanced internal flow pathways in hydraulic valve blocks intensifies.However,owing to the constraints imposed...As electro-hydrostatic actuator(EHA)technology advances towards lightweight and integration,the demand for enhanced internal flow pathways in hydraulic valve blocks intensifies.However,owing to the constraints imposed by traditional manufacturing processes,conventional hydraulic integrated valve blocks fail to satisfy the demands of a more compact channel layout and lower energy dissipation.Notably,the subjectivity in the arrangement of internal passages results in a time-consuming and labor-intensive process.This study employed additive manufacturing technology and the ant colony algorithm and B-spline curves for the meticulous design of internal passages within an aviation EHA valve block.The layout environment for the valve block passages was established,and path optimization was achieved using the ant colony algorithm,complemented by smoothing using B-spline curves.Three-dimensional modeling was performed using SolidWorks software,revealing a 10.03%reduction in volume for the optimized passages compared with the original passages.Computational fluid dynamics(CFD)simulations were performed using Fluent software,demonstrating that the algorithmically optimized passages effectively prevented the occurrence of vortices at right-angled locations,exhibited superior flow characteristics,and concurrently reduced pressure losses by 34.09%-36.36%.The small discrepancy between the experimental and simulation results validated the efficacy of the ant colony algorithm and B-spline curves in optimizing the passage design,offering a viable solution for channel design in additive manufacturing.展开更多
In order to solve the problem of path planning of tower cranes,an improved ant colony algorithm was proposed.Firstly,the tower crane was simplified into a three-degree-of-freedom mechanical arm,and the D-H motion mode...In order to solve the problem of path planning of tower cranes,an improved ant colony algorithm was proposed.Firstly,the tower crane was simplified into a three-degree-of-freedom mechanical arm,and the D-H motion model was established to solve the forward and inverse kinematic equations.Secondly,the traditional ant colony algorithm was improved.The heuristic function was improved by introducing the distance between the optional nodes and the target point into the function.Then the transition probability was improved by introducing the security factor of surrounding points into the transition probability.In addition,the local path chunking strategy was used to optimize the local multi-inflection path and reduce the local redundant inflection points.Finally,according to the position of the hook,the kinematic inversion of the tower crane was carried out,and the variables of each joint were obtained.More specifically,compared with the traditional ant colony algorithm,the simulation results showed that improved ant colony algorithm converged faster,shortened the optimal path length,and optimized the path quality in the simple and complex environment.展开更多
This advanced paper presents a new approach to improving image steganography using the Ant Colony Optimization(ACO)algorithm.Image steganography,a technique of embedding hidden information in digital photographs,shoul...This advanced paper presents a new approach to improving image steganography using the Ant Colony Optimization(ACO)algorithm.Image steganography,a technique of embedding hidden information in digital photographs,should ideally achieve the dual purposes of maximum data hiding and maintenance of the integrity of the cover media so that it is least suspect.The contemporary methods of steganography are at best a compromise between these two.In this paper,we present our approach,entitled Ant Colony Optimization(ACO)-Least Significant Bit(LSB),which attempts to optimize the capacity in steganographic embedding.The approach makes use of a grayscale cover image to hide the confidential data with an additional bit pair per byte,both for integrity verification and the file checksumof the secret data.This approach encodes confidential information into four pairs of bits and embeds it within uncompressed grayscale images.The ACO algorithm uses adaptive exploration to select some pixels,maximizing the capacity of data embedding whileminimizing the degradation of visual quality.Pheromone evaporation is introduced through iterations to avoid stagnation in solution refinement.The levels of pheromone are modified to reinforce successful pixel choices.Experimental results obtained through the ACO-LSB method reveal that it clearly improves image steganography capabilities by providing an increase of up to 30%in the embedding capacity compared with traditional approaches;the average Peak Signal to Noise Ratio(PSNR)is 40.5 dB with a Structural Index Similarity(SSIM)of 0.98.The approach also demonstrates very high resistance to detection,cutting down the rate by 20%.Implemented in MATLAB R2023a,the model was tested against one thousand publicly available grayscale images,thus providing robust evidence of its effectiveness.展开更多
The world produces vast quantities of high-dimensional multi-semantic data.However,extracting valuable information from such a large amount of high-dimensional and multi-label data is undoubtedly arduous and challengi...The world produces vast quantities of high-dimensional multi-semantic data.However,extracting valuable information from such a large amount of high-dimensional and multi-label data is undoubtedly arduous and challenging.Feature selection aims to mitigate the adverse impacts of high dimensionality in multi-label data by eliminating redundant and irrelevant features.The ant colony optimization algorithm has demonstrated encouraging outcomes in multi-label feature selection,because of its simplicity,efficiency,and similarity to reinforcement learning.Nevertheless,existing methods do not consider crucial correlation information,such as dynamic redundancy and label correlation.To tackle these concerns,the paper proposes a multi-label feature selection technique based on ant colony optimization algorithm(MFACO),focusing on dynamic redundancy and label correlation.Initially,the dynamic redundancy is assessed between the selected feature subset and potential features.Meanwhile,the ant colony optimization algorithm extracts label correlation from the label set,which is then combined into the heuristic factor as label weights.Experimental results demonstrate that our proposed strategies can effectively enhance the optimal search ability of ant colony,outperforming the other algorithms involved in the paper.展开更多
[Objective] The aim was to study the feature extraction of stored-grain insects based on ant colony optimization and support vector machine algorithm, and to explore the feasibility of the feature extraction of stored...[Objective] The aim was to study the feature extraction of stored-grain insects based on ant colony optimization and support vector machine algorithm, and to explore the feasibility of the feature extraction of stored-grain insects. [Method] Through the analysis of feature extraction in the image recognition of the stored-grain insects, the recognition accuracy of the cross-validation training model in support vector machine （SVM） algorithm was taken as an important factor of the evaluation principle of feature extraction of stored-grain insects. The ant colony optimization （ACO） algorithm was applied to the automatic feature extraction of stored-grain insects. [Result] The algorithm extracted the optimal feature subspace of seven features from the 17 morphological features, including area and perimeter. The ninety image samples of the stored-grain insects were automatically recognized by the optimized SVM classifier, and the recognition accuracy was over 95%. [Conclusion] The experiment shows that the application of ant colony optimization to the feature extraction of grain insects is practical and feasible.展开更多
In this paper,a fusion model based on a long short-term memory(LSTM)neural network and enhanced search ant colony optimization(ENSACO)is proposed to predict the power degradation trend of proton exchange membrane fuel...In this paper,a fusion model based on a long short-term memory(LSTM)neural network and enhanced search ant colony optimization(ENSACO)is proposed to predict the power degradation trend of proton exchange membrane fuel cells(PEMFC).Firstly,the Shapley additive explanations(SHAP)value method is used to select external characteristic parameters with high contributions as inputs for the data-driven approach.Next,a novel swarm optimization algorithm,the enhanced search ant colony optimization,is proposed.This algorithm improves the ant colony optimization(ACO)algorithm based on a reinforcement factor to avoid premature convergence and accelerate the convergence speed.Comparative experiments are set up to compare the performance differences between particle swarm optimization(PSO),ACO,and ENSACO.Finally,a data-driven method based on ENSACO-LSTM is proposed to predict the power degradation trend of PEMFCs.And actual aging data is used to validate the method.The results show that,within a limited number of iterations,the optimization capability of ENSACO is significantly stronger than that of PSO and ACO.Additionally,the prediction accuracy of the ENSACO-LSTM method is greatly improved,with an average increase of approximately 50.58%compared to LSTM,PSO-LSTM,and ACO-LSTM.展开更多
The rapid proliferation of renewable energy integration and escalating grid operational complexity have intensified demands for resilient self-healing mechanisms in modern power systems.Conventional approaches relying...The rapid proliferation of renewable energy integration and escalating grid operational complexity have intensified demands for resilient self-healing mechanisms in modern power systems.Conventional approaches relying on static models and heuristic rules exhibit limitations in addressing dynamic fault propagation and multimodal data fusion.This study proposes a Transformer-enhanced intelligent microgrid self-healing framework that synergizes large languagemodels(LLMs)with adaptive optimization,achieving three key innovations:(1)Ahierarchical attention mechanism incorporating grid impedance characteristics for spatiotemporal feature extraction,(2)Dynamic covariance estimation Kalman filtering with wavelet packet energy entropy thresholds(Daubechies-4 basis,6-level decomposition),and(3)A grouping-stratified ant colony optimization algorithm featuring penalty-based pheromone updating.Validated on IEEE 33/100-node systems,our framework demonstrates 96.7%fault localization accuracy(23%improvement over STGCN)and 0.82-s protection delay,outperforming MILP-basedmethods by 37%in reconfiguration speed.The system maintains 98.4%self-healing success rate under cascading faults,resolving 89.3%of phase-toground faults within 500 ms through adaptive impedance matching.Field tests on 220 kV substations with 45%renewable penetration show 99.1%voltage stability(±5%deviation threshold)and 40%communication efficiency gains via compressed GOOSE message parsing.Comparative analysis reveals 12.6×faster convergence than conventional ACO in 1000-node networks,with 95.2%robustness against±25%load fluctuations.These advancements provide a scalable solution for real-time fault recovery in renewable-dense grids,reducing outage duration by 63%inmulti-agent simulations compared to centralized architectures.展开更多
This paper aims at rescheduling of observing spacecraft imaging plans under uncertainties. Firstly, uncertainties in spacecraft observation scheduling are analyzed. Then, considering the uncertainties with fuzzy featu...This paper aims at rescheduling of observing spacecraft imaging plans under uncertainties. Firstly, uncertainties in spacecraft observation scheduling are analyzed. Then, considering the uncertainties with fuzzy features, this paper proposes a fuzzy neural network and a hybrid rescheduling policy to deal with them. It then establishes a mathematical model and manages to solve the rescheduling problem by proposing an ant colony algorithm, which introduces an adaptive control mechanism and takes advantage of the information in an existing schedule. Finally, the above method is applied to solve the rescheduling problem of a certain type of earth-observing satellite. The computation of the example shows that the approach is feasible and effective in dealing with uncertainties in spacecraft observation scheduling. The approach designed here can be useful in solving the problem that the original schedule is contaminated by disturbances.展开更多
The ant colony algorithm is a new class of population basic algorithm. The path planning is realized by the use of ant colony algorithm when the plane executes the low altitude penetration, which provides a new method...The ant colony algorithm is a new class of population basic algorithm. The path planning is realized by the use of ant colony algorithm when the plane executes the low altitude penetration, which provides a new method for the path planning. In the paper the traditional ant colony algorithm is improved, and measures of keeping optimization, adaptively selecting and adaptively adjusting are applied, by which better path at higher convergence speed can be found. Finally the algorithm is implemented with computer simulation and preferable results are obtained.展开更多
A weapon target assignment （WTA） model satisfying expected damage probabilities with an ant colony algorithm is proposed. In order to save armament resource and attack the targets effectively, the strategy of the we...A weapon target assignment （WTA） model satisfying expected damage probabilities with an ant colony algorithm is proposed. In order to save armament resource and attack the targets effectively, the strategy of the weapon assignment is that the target with greater threat degree has higher priority to be intercepted. The effect of this WTA model is not maximizing the damage probability but satisfying the whole assignment result. Ant colony algorithm has been successfully used in many fields, especially in combination optimization. The ant colony algorithm for this WTA problem is described by analyzing path selection, pheromone update, and tabu table update. The effectiveness of the model and the algorithm is demonstrated with an example.展开更多
An adaptive ant colony algorithm is proposed based on dynamically adjusting the strategy of updating trail information. The algorithm can keep good balance between accelerating convergence and averting precocity and s...An adaptive ant colony algorithm is proposed based on dynamically adjusting the strategy of updating trail information. The algorithm can keep good balance between accelerating convergence and averting precocity and stagnation. The results of function optimization show that the algorithm has good searching ability and high convergence speed. The algorithm is employed to design a neuro-fuzzy controller for real-time control of an inverted pendulum. In order to avoid the combinatorial explosion of fuzzy rules due tσ multivariable inputs, a state variable synthesis scheme is employed to reduce the number of fuzzy rules greatly. The simulation results show that the designed controller can control the inverted pendulum successfully.展开更多
Ant colony algorithms comprise a novel category of evolutionary computation methods for optimization problems, especially for sequencing-type combinatorial optimization problems. An adaptive ant colony algorithm is pr...Ant colony algorithms comprise a novel category of evolutionary computation methods for optimization problems, especially for sequencing-type combinatorial optimization problems. An adaptive ant colony algorithm is proposed in this paper to tackle continuous-space optimization problems, using a new objective-function-based heuristic pheromone assignment approach for pheromone update to filtrate solution candidates.Global optimal solutions can be reached more rapidly by self-adjusting the path searching behaviors of the ants according to objective values. The performance of the proposed algorithm is compared with a basic ant colony algorithm and a Square Quadratic Programming approach in solving two benchmark problems with multiple extremes. The results indicated that the efficiency and reliability of the proposed algorithm were greatly improved.展开更多
The information transmission path optimization(ITPO) can often a ect the e ciency and accuracy of remanufactur?ing service. However, there is a greater degree of uncertainty and complexity in information transmission ...The information transmission path optimization(ITPO) can often a ect the e ciency and accuracy of remanufactur?ing service. However, there is a greater degree of uncertainty and complexity in information transmission of remanu?facturing service system, which leads to a critical need for designing planning models to deal with this added uncer?tainty and complexity. In this paper, a three?dimensional(3D) model of remanufacturing service information network for information transmission is developed, which combines the physic coordinate and the transmitted properties of all the devices in the remanufacturing service system. In order to solve the basic ITPO in the 3D model, an improved 3D ant colony algorithm(Improved AC) was put forward. Moreover, to further improve the operation e ciency of the algorithm, an improved ant colony?genetic algorithm(AC?GA) that combines the improved AC and genetic algorithm was developed. In addition, by taking the transmission of remanufacturing service demand information of certain roller as example, the e ectiveness of AC?GA algorithm was analyzed and compared with that of improved AC, and the results demonstrated that AC?GA algorithm was superior to AC algorithm in aspects of information transmission delay, information transmission cost, and rate of information loss.展开更多
Aimed at the problems of a traditional ant colony algorithm,such as the path search direction and field of view,an inability to find the shortest path,a propensity toward deadlock and an unsmooth path,an ant colony al...Aimed at the problems of a traditional ant colony algorithm,such as the path search direction and field of view,an inability to find the shortest path,a propensity toward deadlock and an unsmooth path,an ant colony algorithm for use in a new environment is proposed.First,the feature points of an obstacle are extracted to preprocess the grid map environment,which can avoid entering a trap and solve the deadlock problem.Second,these feature points are used as pathfinding access nodes to reduce the node access,with more moving directions to be selected,and the locations of the feature points to be selected determine the range of the pathfinding field of view.Then,based on the feature points,an unequal distribution of pheromones and a two-way parallel path search are used to improve the construction efficiency of the solution,an improved heuristic function is used to enhance the guiding role of the path search,and the pheromone volatilization coefficient is dynamically adjusted to avoid a premature convergence of the algorithm.Third,a Bezier curve is used to smooth the shortest path obtained.Finally,using grid maps with a different complexity and different scales,a simulation comparing the results of the proposed algorithm with those of traditional and other improved ant colony algorithms verifies its feasibility and superiority.展开更多
A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK ...A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.展开更多
Based on structural surface normal vector spherical distance and the pole stereographic projection Euclidean distance,two distance functions were established.The cluster analysis of structure surface was conducted by ...Based on structural surface normal vector spherical distance and the pole stereographic projection Euclidean distance,two distance functions were established.The cluster analysis of structure surface was conducted by the use of ATTA clustering methods based on ant colony piles,and Silhouette index was introduced to evaluate the clustering effect.The clustering analysis of the measured data of Sanshandao Gold Mine shows that ant colony ATTA-based clustering method does better than K-mean clustering analysis.Meanwhile,clustering results of ATTA method based on pole Euclidean distance and ATTA method based on normal vector spherical distance have a great consistence.The clustering results are most close to the pole isopycnic graph.It can efficiently realize grouping of structural plane and determination of the dominant structural surface direction.It is made up for the defects of subjectivity and inaccuracy in icon measurement approach and has great engineering value.展开更多
Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective funct...Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.展开更多
The ant system algorithm （ASA） has proved to be a novel meta-heuristic algorithm to solve many multivariable problems. In this paper, the earth coverage of satellite constellation is analyzed and a n ＋ 1^ -fold cov...The ant system algorithm （ASA） has proved to be a novel meta-heuristic algorithm to solve many multivariable problems. In this paper, the earth coverage of satellite constellation is analyzed and a n ＋ 1^ -fold coverage rate is put forward to evaluate the coverage performance of a satellite constellation. An optimization model of constellation parameters is established on the basis of the coverage performance. As a newly developed method, ASA can be applied to optimize the constellation parameters. In order to improve the ASA, a rule for adaptive number of ants is proposed, by which the search range is obviously enlarged and the convergence speed increased. Simulation results have shown that the ASA is more quick and efficient than other methodV211.71s.展开更多
A new and intelligent design method for PID controller with incomplete derivation is proposed based on the ant system algorithm ( ASA) . For a given control system with this kind of PID controller, a group of optimal ...A new and intelligent design method for PID controller with incomplete derivation is proposed based on the ant system algorithm ( ASA) . For a given control system with this kind of PID controller, a group of optimal PID controller parameters K p * , T i * , and T d * can be obtained by taking the overshoot, settling time, and steady-state error of the system's unit step response as the performance indexes and by use of our improved ant system algorithm. K p * , T i * , and T d * can be used in real-time control. This kind of controller is called the ASA-PID controller with incomplete derivation. To verify the performance of the ASA-PID controller, three different typical transfer functions were tested, and three existing typical tuning methods of PID controller parameters, including the Ziegler-Nichols method (ZN),the genetic algorithm (GA),and the simulated annealing (SA), were adopted for comparison. The simulation results showed that the ASA-PID controller can be used to control different objects and has better performance compared with the ZN-PID and GA-PID controllers, and comparable performance compared with the SA-PID controller.展开更多
基金Sponsored by the National High Technology Research and Development Program of China(2006AA701306)the National Innovation Foundation of Enterprises(05C26212200378)
文摘Improved traditional ant colony algorithms,a data routing model used to the data remote exchange on WAN was presented.In the model,random heuristic factors were introduced to realize multi-path search.The updating model of pheromone could adjust the pheromone concentration on the optimal path according to path load dynamically to make the system keep load balance.The simulation results show that the improved model has a higher performance on convergence and load balance.
基金Supported by National Natural Science Foundation of China(Grant No.51890881)。
文摘As electro-hydrostatic actuator(EHA)technology advances towards lightweight and integration,the demand for enhanced internal flow pathways in hydraulic valve blocks intensifies.However,owing to the constraints imposed by traditional manufacturing processes,conventional hydraulic integrated valve blocks fail to satisfy the demands of a more compact channel layout and lower energy dissipation.Notably,the subjectivity in the arrangement of internal passages results in a time-consuming and labor-intensive process.This study employed additive manufacturing technology and the ant colony algorithm and B-spline curves for the meticulous design of internal passages within an aviation EHA valve block.The layout environment for the valve block passages was established,and path optimization was achieved using the ant colony algorithm,complemented by smoothing using B-spline curves.Three-dimensional modeling was performed using SolidWorks software,revealing a 10.03%reduction in volume for the optimized passages compared with the original passages.Computational fluid dynamics(CFD)simulations were performed using Fluent software,demonstrating that the algorithmically optimized passages effectively prevented the occurrence of vortices at right-angled locations,exhibited superior flow characteristics,and concurrently reduced pressure losses by 34.09%-36.36%.The small discrepancy between the experimental and simulation results validated the efficacy of the ant colony algorithm and B-spline curves in optimizing the passage design,offering a viable solution for channel design in additive manufacturing.
基金supported by Shaanxi Provincial Key Research and Development Program of China(Nos.2024GX-YBXM-305,2024GX-YBXM-178)Shaanxi Province Qinchuangyuan“Scientists+Engineers”Team Construction(No.2022KXJ032)。
文摘In order to solve the problem of path planning of tower cranes,an improved ant colony algorithm was proposed.Firstly,the tower crane was simplified into a three-degree-of-freedom mechanical arm,and the D-H motion model was established to solve the forward and inverse kinematic equations.Secondly,the traditional ant colony algorithm was improved.The heuristic function was improved by introducing the distance between the optional nodes and the target point into the function.Then the transition probability was improved by introducing the security factor of surrounding points into the transition probability.In addition,the local path chunking strategy was used to optimize the local multi-inflection path and reduce the local redundant inflection points.Finally,according to the position of the hook,the kinematic inversion of the tower crane was carried out,and the variables of each joint were obtained.More specifically,compared with the traditional ant colony algorithm,the simulation results showed that improved ant colony algorithm converged faster,shortened the optimal path length,and optimized the path quality in the simple and complex environment.
文摘This advanced paper presents a new approach to improving image steganography using the Ant Colony Optimization(ACO)algorithm.Image steganography,a technique of embedding hidden information in digital photographs,should ideally achieve the dual purposes of maximum data hiding and maintenance of the integrity of the cover media so that it is least suspect.The contemporary methods of steganography are at best a compromise between these two.In this paper,we present our approach,entitled Ant Colony Optimization(ACO)-Least Significant Bit(LSB),which attempts to optimize the capacity in steganographic embedding.The approach makes use of a grayscale cover image to hide the confidential data with an additional bit pair per byte,both for integrity verification and the file checksumof the secret data.This approach encodes confidential information into four pairs of bits and embeds it within uncompressed grayscale images.The ACO algorithm uses adaptive exploration to select some pixels,maximizing the capacity of data embedding whileminimizing the degradation of visual quality.Pheromone evaporation is introduced through iterations to avoid stagnation in solution refinement.The levels of pheromone are modified to reinforce successful pixel choices.Experimental results obtained through the ACO-LSB method reveal that it clearly improves image steganography capabilities by providing an increase of up to 30%in the embedding capacity compared with traditional approaches;the average Peak Signal to Noise Ratio(PSNR)is 40.5 dB with a Structural Index Similarity(SSIM)of 0.98.The approach also demonstrates very high resistance to detection,cutting down the rate by 20%.Implemented in MATLAB R2023a,the model was tested against one thousand publicly available grayscale images,thus providing robust evidence of its effectiveness.
基金supported by National Natural Science Foundation of China(Grant Nos.62376089,62302153,62302154,62202147)the key Research and Development Program of Hubei Province,China(Grant No.2023BEB024).
文摘The world produces vast quantities of high-dimensional multi-semantic data.However,extracting valuable information from such a large amount of high-dimensional and multi-label data is undoubtedly arduous and challenging.Feature selection aims to mitigate the adverse impacts of high dimensionality in multi-label data by eliminating redundant and irrelevant features.The ant colony optimization algorithm has demonstrated encouraging outcomes in multi-label feature selection,because of its simplicity,efficiency,and similarity to reinforcement learning.Nevertheless,existing methods do not consider crucial correlation information,such as dynamic redundancy and label correlation.To tackle these concerns,the paper proposes a multi-label feature selection technique based on ant colony optimization algorithm(MFACO),focusing on dynamic redundancy and label correlation.Initially,the dynamic redundancy is assessed between the selected feature subset and potential features.Meanwhile,the ant colony optimization algorithm extracts label correlation from the label set,which is then combined into the heuristic factor as label weights.Experimental results demonstrate that our proposed strategies can effectively enhance the optimal search ability of ant colony,outperforming the other algorithms involved in the paper.
基金Supported by the National Natural Science Foundation of China(31101085)the Program for Young Core Teachers of Colleges in Henan(2011GGJS-094)the Scientific Research Project for the High Level Talents,North China University of Water Conservancy and Hydroelectric Power~~
文摘[Objective] The aim was to study the feature extraction of stored-grain insects based on ant colony optimization and support vector machine algorithm, and to explore the feasibility of the feature extraction of stored-grain insects. [Method] Through the analysis of feature extraction in the image recognition of the stored-grain insects, the recognition accuracy of the cross-validation training model in support vector machine （SVM） algorithm was taken as an important factor of the evaluation principle of feature extraction of stored-grain insects. The ant colony optimization （ACO） algorithm was applied to the automatic feature extraction of stored-grain insects. [Result] The algorithm extracted the optimal feature subspace of seven features from the 17 morphological features, including area and perimeter. The ninety image samples of the stored-grain insects were automatically recognized by the optimized SVM classifier, and the recognition accuracy was over 95%. [Conclusion] The experiment shows that the application of ant colony optimization to the feature extraction of grain insects is practical and feasible.
基金Supported by the Major Science and Technology Project of Jilin Province(20220301010GX)the International Scientific and Technological Cooperation(20240402071GH).
文摘In this paper,a fusion model based on a long short-term memory(LSTM)neural network and enhanced search ant colony optimization(ENSACO)is proposed to predict the power degradation trend of proton exchange membrane fuel cells(PEMFC).Firstly,the Shapley additive explanations(SHAP)value method is used to select external characteristic parameters with high contributions as inputs for the data-driven approach.Next,a novel swarm optimization algorithm,the enhanced search ant colony optimization,is proposed.This algorithm improves the ant colony optimization(ACO)algorithm based on a reinforcement factor to avoid premature convergence and accelerate the convergence speed.Comparative experiments are set up to compare the performance differences between particle swarm optimization(PSO),ACO,and ENSACO.Finally,a data-driven method based on ENSACO-LSTM is proposed to predict the power degradation trend of PEMFCs.And actual aging data is used to validate the method.The results show that,within a limited number of iterations,the optimization capability of ENSACO is significantly stronger than that of PSO and ACO.Additionally,the prediction accuracy of the ENSACO-LSTM method is greatly improved,with an average increase of approximately 50.58%compared to LSTM,PSO-LSTM,and ACO-LSTM.
基金the project“Research on Power SafetyDecision Support SystemBased on Large Language Models”(Science and Technology Project of Huaian Hongneng Group Co.,Ltd.)under Contract No.SGTYHT/23-JS-001.
文摘The rapid proliferation of renewable energy integration and escalating grid operational complexity have intensified demands for resilient self-healing mechanisms in modern power systems.Conventional approaches relying on static models and heuristic rules exhibit limitations in addressing dynamic fault propagation and multimodal data fusion.This study proposes a Transformer-enhanced intelligent microgrid self-healing framework that synergizes large languagemodels(LLMs)with adaptive optimization,achieving three key innovations:(1)Ahierarchical attention mechanism incorporating grid impedance characteristics for spatiotemporal feature extraction,(2)Dynamic covariance estimation Kalman filtering with wavelet packet energy entropy thresholds(Daubechies-4 basis,6-level decomposition),and(3)A grouping-stratified ant colony optimization algorithm featuring penalty-based pheromone updating.Validated on IEEE 33/100-node systems,our framework demonstrates 96.7%fault localization accuracy(23%improvement over STGCN)and 0.82-s protection delay,outperforming MILP-basedmethods by 37%in reconfiguration speed.The system maintains 98.4%self-healing success rate under cascading faults,resolving 89.3%of phase-toground faults within 500 ms through adaptive impedance matching.Field tests on 220 kV substations with 45%renewable penetration show 99.1%voltage stability(±5%deviation threshold)and 40%communication efficiency gains via compressed GOOSE message parsing.Comparative analysis reveals 12.6×faster convergence than conventional ACO in 1000-node networks,with 95.2%robustness against±25%load fluctuations.These advancements provide a scalable solution for real-time fault recovery in renewable-dense grids,reducing outage duration by 63%inmulti-agent simulations compared to centralized architectures.
基金supported by the National Natural Science Foundation of China (No. 61203151)the National Basic Research Program of China (973 Program) (No. 2012CB720003)+2 种基金the Postdoctoral Science Foundation of China (20100471044)the Fundamental Research Funds for the Central Universities of China (No. HIT.NSRIF.2013038)the Key Laboratory Opening Funding of China (No. HIT.KLOF.2009071)
文摘This paper aims at rescheduling of observing spacecraft imaging plans under uncertainties. Firstly, uncertainties in spacecraft observation scheduling are analyzed. Then, considering the uncertainties with fuzzy features, this paper proposes a fuzzy neural network and a hybrid rescheduling policy to deal with them. It then establishes a mathematical model and manages to solve the rescheduling problem by proposing an ant colony algorithm, which introduces an adaptive control mechanism and takes advantage of the information in an existing schedule. Finally, the above method is applied to solve the rescheduling problem of a certain type of earth-observing satellite. The computation of the example shows that the approach is feasible and effective in dealing with uncertainties in spacecraft observation scheduling. The approach designed here can be useful in solving the problem that the original schedule is contaminated by disturbances.
文摘The ant colony algorithm is a new class of population basic algorithm. The path planning is realized by the use of ant colony algorithm when the plane executes the low altitude penetration, which provides a new method for the path planning. In the paper the traditional ant colony algorithm is improved, and measures of keeping optimization, adaptively selecting and adaptively adjusting are applied, by which better path at higher convergence speed can be found. Finally the algorithm is implemented with computer simulation and preferable results are obtained.
文摘A weapon target assignment （WTA） model satisfying expected damage probabilities with an ant colony algorithm is proposed. In order to save armament resource and attack the targets effectively, the strategy of the weapon assignment is that the target with greater threat degree has higher priority to be intercepted. The effect of this WTA model is not maximizing the damage probability but satisfying the whole assignment result. Ant colony algorithm has been successfully used in many fields, especially in combination optimization. The ant colony algorithm for this WTA problem is described by analyzing path selection, pheromone update, and tabu table update. The effectiveness of the model and the algorithm is demonstrated with an example.
文摘An adaptive ant colony algorithm is proposed based on dynamically adjusting the strategy of updating trail information. The algorithm can keep good balance between accelerating convergence and averting precocity and stagnation. The results of function optimization show that the algorithm has good searching ability and high convergence speed. The algorithm is employed to design a neuro-fuzzy controller for real-time control of an inverted pendulum. In order to avoid the combinatorial explosion of fuzzy rules due tσ multivariable inputs, a state variable synthesis scheme is employed to reduce the number of fuzzy rules greatly. The simulation results show that the designed controller can control the inverted pendulum successfully.
文摘Ant colony algorithms comprise a novel category of evolutionary computation methods for optimization problems, especially for sequencing-type combinatorial optimization problems. An adaptive ant colony algorithm is proposed in this paper to tackle continuous-space optimization problems, using a new objective-function-based heuristic pheromone assignment approach for pheromone update to filtrate solution candidates.Global optimal solutions can be reached more rapidly by self-adjusting the path searching behaviors of the ants according to objective values. The performance of the proposed algorithm is compared with a basic ant colony algorithm and a Square Quadratic Programming approach in solving two benchmark problems with multiple extremes. The results indicated that the efficiency and reliability of the proposed algorithm were greatly improved.
基金National Natural Science Foundation of China(Grant Nos.51805385,71471143)Hubei Provincial Natural Science Foundation of China(Grant No.2018CFB265)Center for Service Science and Engineering of Wuhan University of Science and Technology(Grant No.CSSE2017KA04)
文摘The information transmission path optimization(ITPO) can often a ect the e ciency and accuracy of remanufactur?ing service. However, there is a greater degree of uncertainty and complexity in information transmission of remanu?facturing service system, which leads to a critical need for designing planning models to deal with this added uncer?tainty and complexity. In this paper, a three?dimensional(3D) model of remanufacturing service information network for information transmission is developed, which combines the physic coordinate and the transmitted properties of all the devices in the remanufacturing service system. In order to solve the basic ITPO in the 3D model, an improved 3D ant colony algorithm(Improved AC) was put forward. Moreover, to further improve the operation e ciency of the algorithm, an improved ant colony?genetic algorithm(AC?GA) that combines the improved AC and genetic algorithm was developed. In addition, by taking the transmission of remanufacturing service demand information of certain roller as example, the e ectiveness of AC?GA algorithm was analyzed and compared with that of improved AC, and the results demonstrated that AC?GA algorithm was superior to AC algorithm in aspects of information transmission delay, information transmission cost, and rate of information loss.
基金the National Natural Science Founda-tion(Nos.62063019 and 61763026)the Gansu Nat-ural Science Foundation Project(No.20JR10RA152)the Gansu Provincial Department of Educa-tion:Excellent Graduate“Innovation Star”Project(No.2021CXZX-507)。
文摘Aimed at the problems of a traditional ant colony algorithm,such as the path search direction and field of view,an inability to find the shortest path,a propensity toward deadlock and an unsmooth path,an ant colony algorithm for use in a new environment is proposed.First,the feature points of an obstacle are extracted to preprocess the grid map environment,which can avoid entering a trap and solve the deadlock problem.Second,these feature points are used as pathfinding access nodes to reduce the node access,with more moving directions to be selected,and the locations of the feature points to be selected determine the range of the pathfinding field of view.Then,based on the feature points,an unequal distribution of pheromones and a two-way parallel path search are used to improve the construction efficiency of the solution,an improved heuristic function is used to enhance the guiding role of the path search,and the pheromone volatilization coefficient is dynamically adjusted to avoid a premature convergence of the algorithm.Third,a Bezier curve is used to smooth the shortest path obtained.Finally,using grid maps with a different complexity and different scales,a simulation comparing the results of the proposed algorithm with those of traditional and other improved ant colony algorithms verifies its feasibility and superiority.
文摘A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.
基金Project(41272304)supported by the National Natural Science Foundation of ChinaProject(51074177)jointly supported by the National Natural Science Foundation and Shanghai Baosteel Group Corporation,ChinaProject(CX2012B070)supported by Hunan Provincial Innovation Fund for Postgraduated Students,China
文摘Based on structural surface normal vector spherical distance and the pole stereographic projection Euclidean distance,two distance functions were established.The cluster analysis of structure surface was conducted by the use of ATTA clustering methods based on ant colony piles,and Silhouette index was introduced to evaluate the clustering effect.The clustering analysis of the measured data of Sanshandao Gold Mine shows that ant colony ATTA-based clustering method does better than K-mean clustering analysis.Meanwhile,clustering results of ATTA method based on pole Euclidean distance and ATTA method based on normal vector spherical distance have a great consistence.The clustering results are most close to the pole isopycnic graph.It can efficiently realize grouping of structural plane and determination of the dominant structural surface direction.It is made up for the defects of subjectivity and inaccuracy in icon measurement approach and has great engineering value.
基金supported by the the Youth Science and Technology Innovation Fund (Science)(Nos.NS2014070, NS2014070)
文摘Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.
文摘The ant system algorithm （ASA） has proved to be a novel meta-heuristic algorithm to solve many multivariable problems. In this paper, the earth coverage of satellite constellation is analyzed and a n ＋ 1^ -fold coverage rate is put forward to evaluate the coverage performance of a satellite constellation. An optimization model of constellation parameters is established on the basis of the coverage performance. As a newly developed method, ASA can be applied to optimize the constellation parameters. In order to improve the ASA, a rule for adaptive number of ants is proposed, by which the search range is obviously enlarged and the convergence speed increased. Simulation results have shown that the ASA is more quick and efficient than other methodV211.71s.
基金This work was supported by the National Natural Science Foundation of China (No. 50275150)the Foundation of Robotics Laboratory, Chinese Academy of Sciences( No. RL200002).
文摘A new and intelligent design method for PID controller with incomplete derivation is proposed based on the ant system algorithm ( ASA) . For a given control system with this kind of PID controller, a group of optimal PID controller parameters K p * , T i * , and T d * can be obtained by taking the overshoot, settling time, and steady-state error of the system's unit step response as the performance indexes and by use of our improved ant system algorithm. K p * , T i * , and T d * can be used in real-time control. This kind of controller is called the ASA-PID controller with incomplete derivation. To verify the performance of the ASA-PID controller, three different typical transfer functions were tested, and three existing typical tuning methods of PID controller parameters, including the Ziegler-Nichols method (ZN),the genetic algorithm (GA),and the simulated annealing (SA), were adopted for comparison. The simulation results showed that the ASA-PID controller can be used to control different objects and has better performance compared with the ZN-PID and GA-PID controllers, and comparable performance compared with the SA-PID controller.
