An Improved Image Steganography Security and Capacity Using Ant Colony Algorithm Optimization

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.

Multi-Label Feature Selection Based on Improved Ant Colony Optimization Algorithm with Dynamic Redundancy and Label Dependence

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.

Bio-Inspired Intelligent Routing in WSN: Integrating Mayfly Optimization and Enhanced Ant Colony Optimization for Energy-Efficient Cluster Formation and Maintenance

Wireless Sensor Networks(WSNs)are a collection of sensor nodes distributed in space and connected through wireless communication.The sensor nodes gather and store data about the real world around them.However,the nodes that are dependent on batteries will ultimately suffer an energy loss with time,which affects the lifetime of the network.This research proposes to achieve its primary goal by reducing energy consumption and increasing the network’s lifetime and stability.The present technique employs the hybrid Mayfly Optimization Algorithm-Enhanced Ant Colony Optimization(MFOA-EACO),where the Mayfly Optimization Algorithm(MFOA)is used to select the best cluster head(CH)from a set of nodes,and the Enhanced Ant Colony Optimization(EACO)technique is used to determine an optimal route between the cluster head and base station.The performance evaluation of our suggested hybrid approach is based on many parameters,including the number of active and dead nodes,node degree,distance,and energy usage.Our objective is to integrate MFOA-EACO to enhance energy efficiency and extend the network life of the WSN in the future.The proposed method outcomes proved to be better than traditional approaches such as Hybrid Squirrel-Flying Fox Optimization Algorithm(HSFLBOA),Hybrid Social Reindeer Optimization and Differential Evolution-Firefly Algorithm(HSRODE-FFA),Social Spider Distance Sensitive-Iterative Antlion Butterfly Cockroach Algorithm(SADSS-IABCA),and Energy Efficient Clustering Hierarchy Strategy-Improved Social Spider Algorithm Differential Evolution(EECHS-ISSADE).

Security Test Case Prioritization through Ant Colony Optimization Algorithm

Security testing is a critical concern for organizations worldwide due to the potential financial setbacks and damage to reputation caused by insecure software systems.One of the challenges in software security testing is test case prioritization,which aims to reduce redundancy in fault occurrences when executing test suites.By effectively applying test case prioritization,both the time and cost required for developing secure software can be reduced.This paper proposes a test case prioritization technique based on the Ant Colony Optimization(ACO)algorithm,a metaheuristic approach.The performance of the ACO-based technique is evaluated using the Average Percentage of Fault Detection(APFD)metric,comparing it with traditional techniques.It has been applied to a Mobile Payment Wallet application to validate the proposed approach.The results demonstrate that the proposed technique outperforms the traditional techniques in terms of the APFD metric.The ACO-based technique achieves an APFD of approximately 76%,two percent higher than the second-best optimal ordering technique.These findings suggest that metaheuristic-based prioritization techniques can effectively identify the best test cases,saving time and improving software security overall.

Research on Grid Planning of Dual Power Distribution Network Based on Parallel Ant Colony Optimization Algorithm

A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.

Feature Extraction of Stored-grain Insects Based on Ant Colony Optimization and Support Vector Machine Algorithm

[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.

Route Search Method for Railway Replacement Buses Adopting Ant Colony Optimization

In recent years, Japan, and especially rural areas have faced the growing problems of debt-ridden local railway lines along with the population decline and aging population. Therefore, it is best to consider the discontinuation of local railway lines and introduce replacement buses to secure the transportation methods of the local people especially in rural areas. Based on the above background, targeting local railway lines that may be discontinued in the near future, appropriate bus stops when provided with potential bus stops were selected, the present study proposed a method that introduces routes for railway replacement buses adopting ant colony optimization (ACO). The improved ACO was designed and developed based on the requirements set concerning the route length, number of turns, road width, accessibility of railway lines and zones without bus stops as well as the constraint conditions concerning the route length, number of turns and zones without bus stops. Original road network data were generated and processed adopting a geographic information systems (GIS), and these are used to search for the optimal route for railway replacement buses adopting the improved ACO concerning the 8 zones on the target railway line (JR Kakogawa line). By comparing the improved ACO with Dijkstra’s algorithm, its relevance was verified and areas needing further improvements were revealed.

Improved ant colony optimization algorithm for the traveling salesman problems

Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is among the most important combinato- rial problems. An ACO algorithm based on scout characteristic is proposed for solving the stagnation behavior and premature con- vergence problem of the basic ACO algorithm on TSP. The main idea is to partition artificial ants into two groups： scout ants and common ants. The common ants work according to the search manner of basic ant colony algorithm, but scout ants have some differences from common ants, they calculate each route＇s muta- tion probability of the current optimal solution using path evaluation model and search around the optimal solution according to the mutation probability. Simulation on TSP shows that the improved algorithm has high efficiency and robustness.

Novel Approach to Nonlinear PID Parameter Optimization Using Ant Colony Optimization Algorithm

This paper presents an application of an Ant Colony Optimization （ACO） algorithm to optimize the parameters in the design of a type of nonlinear PID controller. The ACO algorithm is a novel heuristic bionic algorithm, which is based on the behaviour of real ants in nature searching for food. In order to optimize the parameters of the nonlinear PID controller using ACO algorithm, an objective function based on position tracing error was constructed, and elitist strategy was adopted in the improved ACO algorithm. Detailed simulation steps are presented. This nonlinear PID controller using the ACO algorithm has high precision of control and quick response.

Ant colony optimization algorithm and its application to Neuro-Fuzzy controller design

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.

Optimization of Air Route Network Nodes to Avoid ″Three Areas″ Based on An Adaptive Ant Colony Algorithm

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%.

An adaptive ant colony system algorithm for continuous-space optimization problems

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.

Improved Ant Colony-Genetic Algorithm for Information Transmission Path Optimization in Remanufacturing Service System

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.

Improved Multi-objective Ant Colony Optimization Algorithm and Its Application in Complex Reasoning

The problem of fault reasoning has aroused great concern in scientific and engineering fields.However,fault investigation and reasoning of complex system is not a simple reasoning decision-making problem.It has become a typical multi-constraint and multi-objective reticulate optimization decision-making problem under many influencing factors and constraints.So far,little research has been carried out in this field.This paper transforms the fault reasoning problem of complex system into a paths-searching problem starting from known symptoms to fault causes.Three optimization objectives are considered simultaneously: maximum probability of average fault,maximum average importance,and minimum average complexity of test.Under the constraints of both known symptoms and the causal relationship among different components,a multi-objective optimization mathematical model is set up,taking minimizing cost of fault reasoning as the target function.Since the problem is non-deterministic polynomial-hard(NP-hard),a modified multi-objective ant colony algorithm is proposed,in which a reachability matrix is set up to constrain the feasible search nodes of the ants and a new pseudo-random-proportional rule and a pheromone adjustment mechinism are constructed to balance conflicts between the optimization objectives.At last,a Pareto optimal set is acquired.Evaluation functions based on validity and tendency of reasoning paths are defined to optimize noninferior set,through which the final fault causes can be identified according to decision-making demands,thus realize fault reasoning of the multi-constraint and multi-objective complex system.Reasoning results demonstrate that the improved multi-objective ant colony optimization(IMACO) can realize reasoning and locating fault positions precisely by solving the multi-objective fault diagnosis model,which provides a new method to solve the problem of multi-constraint and multi-objective fault diagnosis and reasoning of complex system.

An effective multi-level algorithm based on ant colony optimization for graph bipartitioning

Partitioning is a fundamental problem with applications to many areas including data mining, parellel processing and Very-large-scale integration （VLSI） design. An effective multi-level algorithm for bisecting graph is proposed. During its coarsening phase, an improved matching approach based on the global information of the graph core is developed with its guidance function. During the refinement phase, the vertex gain is exploited as ant＇s heuristic information and a positive feedback method based on pheromone trails is used to find the global approximate bipartitioning. It is implemented with American National Standards Institute （ANSI） C and compared to MeTiS. The experimental evaluation shows that it performs well and produces encouraging solutions on 18 different graphs benchmarks.

Optimization design of drilling string by screw coal miner based on ant colony algorithm

It took that the weight minimum and drive efficiency maximal were as double optimizing target,the optimization model had built the drilling string,and the optimization solution was used of the ant colony algorithm to find in progress.Adopted a two-layer search of the continuous space ant colony algorithm with overlapping or variation global ant search operation strategy and conjugated gradient partial ant search operation strat- egy.The experiment indicates that the spiral drill weight reduces 16.77% and transports the efficiency enhance 7.05% through the optimization design,the ant colony algorithm application on the spiral drill optimized design has provided the basis for the system re- search screw coal mine machine.

Ant colony algorithm based on genetic method for continuous optimization problem

A new algorithm is presented by using the ant colony algorithm based on genetic method （ACG） to solve the continuous optimization problem. Each component has a seed set. The seed in the set has the value of component, trail information and fitness. The ant chooses a seed from the seed set with the possibility determined by trail information and fitness of the seed. The genetic method is used to form new solutions from the solutions got by the ants. Best solutions are selected to update the seeds in the sets and trail information of the seeds. In updating the trail information, a diffusion function is used to achieve the diffuseness of trail information. The new algorithm is tested with 8 different benchmark functions.

Buffer allocation method of serial production lines based on improved ant colony optimization algorithm

Buffer influences the performance of production lines greatly.To solve the buffer allocation problem(BAP) in serial production lines with unreliable machines effectively,an optimization method is proposed based on an improved ant colony optimization(IACO) algorithm.Firstly,a problem domain describing buffer allocation is structured.Then a mathematical programming model is established with an objective of maximizing throughput rate of the production line.On the basis of the descriptions mentioned above,combining with a two-opt strategy and an acceptance probability rule,an IACO algorithm is built to solve the BAP.Finally,the simulation experiments are designed to evaluate the proposed algorithm.The results indicate that the IACO algorithm is valid and practical.

Electro-Hydraulic Servo System Identification of Continuous Rotary Motor Based on the Integration Algorithm of Genetic Algorithm and Ant Colony Optimization

In order to increase the robust performance of electro-hydraulic servo system, the system transfer function was identified by the intergration algorithm of genetic algorithm and ant colony optimization(GA-ACO), which was based on standard genetic algorithm and combined with positive feedback mechanism of ant colony algorithm. This method can obtain the precise mathematic model of continuous rotary motor which determines the order of servo system. Firstly, by constructing an appropriate fitness function, the problem of system parameters identification is converted into the problem of system parameter optimization. Secondly, in the given upper and lower bounds a set of optimal parameters are selected to meet the best approximation of the actual system. And the result shows that the identification output can trace the sampling output of actual system, and the error is very small. In addition, another set of experimental data are used to test the identification result. The result shows that the identification parameters can approach the actual system. The experimental results verify the feasibility of this method. And it is fit for the parameter identification of general complex system using the integration algorithm of GA-ACO.

Novel Voltage Scaling Algorithm Through Ant Colony Optimization for Embedded Distributed Systems

Dynamic voltage scaling (DVS), supported by many DVS-enabled processors, is an efficient technique for energy-efficient embedded systems. Many researchers work on DVS and have presented various DVS algorithms, some with quite good results. However, the previous algorithms either have a large time complexity or obtain results sensitive to the count of the voltage modes. Fine-grained voltage modes lead to optimal results, but coarse-grained voltage modes cause less optimal one. A new algorithm is presented, which is based on ant colony optimization, called ant colony optimization voltage and task scheduling (ACO-VTS) with a low time complexity implemented by parallelizing and its linear time approximation algorithm. Both of them generate quite good results, saving up to 30% more energy than that of the previous ones under coarse-grained modes, and their results don’t depend on the number of modes available.