scholarly journals Thermal control system based on ant colony algorithm

2021 ◽  
Vol 25 (4 Part B) ◽  
pp. 3179-3189
Author(s):  
Ran Zhang ◽  
Yan Zhou
Keyword(s):  
Inverse Problem ◽  
Heat Conduction ◽  
Heat Source ◽  
Ant Colony Algorithm ◽  
Temperature Curve ◽  
Information Value ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Measuring Point ◽  
Source Seeking

In order to improve the accuracy and speed of solving the inverse problem of source-seeking heat conduction, the paper proposes a correlation-based ant colony optimization algorithm for the inverse problem of source-seeking heat conduction based on the characteristics of the influence of the heat source position on the boundary temperature distribution in the heat conduction problem. This method is used to construct the corresponding heuristic information value for each co-ordinate of the heat source location, which can reflect the degree of similarity between the temperature curve of the calculated measuring point and the temperature curve of the real measuring point, namely the correlation degree. The ant colony optimization algorithm the medium path selection mechanism and the structure of the objective function have been improved. The paper replaces the actual experiment with numerical calculation obtain the temperature of the measuring point, and performs computer programming experiment on the inverse problem. The calculation results show that the calibration method of this heuristic information value and the objective function the construction method can distinguish the quality of the path well, thereby increasing the speed of the ant colony converging to the best path. The computational efficiency is improved by 18-60% compared with the ant colony algorithm that does not consider the correlation.

An Improved Ant Colony Optimization Algorithm for Solving the TSP Problem

2010 ◽  
Vol 26-28 ◽  
pp. 620-624 ◽  
Author(s):  
Zhan Wei Du ◽  
Yong Jian Yang ◽  
Yong Xiong Sun ◽  
Chi Jun Zhang ◽  
Tuan Liang Li
Keyword(s):  
Genetic Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Convergence Time ◽  
Ant Colony Optimization Algorithm ◽  
Data Set ◽  
Research Attention ◽  
Simply Supported ◽  
Source Data

This paper presents a modified Ant Colony Algorithm(ACA) called route-update ant colony algorithm(RUACA). The research attention is focused on improving the computational efficiency in the TSP problem. A new impact factor is introduced and proved to be effective for reducing the convergence time in the RUACA performance. In order to assess the RUACA performance, a simply supported data set of cities, which was taken as the source data in previous research using traditional ACA and genetic algorithm(GA), is chosen as a benchmark case study. Comparing with the ACA and GA results, it is shown that the presented RUACA has successfully solved the TSP problem. The results of the proposed algorithm are found to be satisfactory.

scholarly journals Network Intrusion Detection using a Combination of Fuzzy Clustering and Ant Colony Algorithm

2021 ◽  
Vol 5 (2) ◽  
pp. 11-19
Author(s):  
Yadgar Sirwan Abdulrahman
Keyword(s):  
Intrusion Detection ◽  
Ant Colony Algorithm ◽  
Optimization Problems ◽  
Detection System ◽  
Ant Colony ◽  
Detection Accuracy ◽  
Ant Colony Optimization Algorithm ◽  
Network Intrusion ◽  
Secure Network ◽  
Main Component

As information technology grows, network security is a significant issue and challenge. The intrusion detection system (IDS) is known as the main component of a secure network. An IDS can be considered a set of tools to help identify and report abnormal activities in the network. In this study, we use data mining of a new framework using fuzzy tools and combine it with the ant colony optimization algorithm (ACOR) to overcome the shortcomings of the k-means clustering method and improve detection accuracy in IDSs. Introduced IDS. The ACOR algorithm is recognized as a fast and accurate meta-method for optimization problems. We combine the improved ACOR with the fuzzy c-means algorithm to achieve efficient clustering and intrusion detection. Our proposed hybrid algorithm is reviewed with the NSL-KDD dataset and the ISCX 2012 dataset using various criteria. For further evaluation, our method is compared to other tasks, and the results are compared show that the proposed algorithm has performed better in all cases.

Optimal Coordination of PSS and SSSC Controllers in Power System Using Ant Colony Optimization Algorithm

2021 ◽  
Author(s):  
Mehrdad Ahmadi Kamarposhti ◽  
Ilhami Colak ◽  
Celestine Iwendi ◽  
Shahab S. Band ◽  
Ebuka Ibeke
Keyword(s):  
Power Plant ◽  
Power System ◽  
Ant Colony Algorithm ◽  
Phase Error ◽  
Low Frequency ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Power System Stabilizers ◽  
Three Phase ◽  
Optimal Coordination

Volatility leads to disruption in synchronism between generators of a continuous system. The frequency of the volatility is usually between a few tenths of Hz to several Hz. This volatility is sometimes divided into two types, local and interregional. Local volatility is the low-frequency volatility of a power plant unit or units of a power plant relative to the grid whereas interregional volatility is the volatility of the units of one area relative to the units of another area. The worst kind of low-frequency volatility occurs when the power system in a region has a short three-phase connection to the earth, creating a complete instability of the grid and operating protective systems. One of the ways to improve the dynamic stability and steady-state of the power system is to use power system stabilizers and FACTS devices in the system. In this paper, the stabilization of the power system stabilizers (PSSs) and SSSC is done using the ant colony algorithm. Studies on a four-machine system with the three-phase error were performed in two scenarios and finally compared with the PSO method. The simulation results show that the proposed method produced more accurate performance.

Comparison of GA, ACO algorithm, and PSO algorithm for path optimization on free-form surfaces using coordinate measuring machines

2021 ◽  
Author(s):  
Yueping Chen ◽  
Naiqi Shang
Keyword(s):  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Path Optimization ◽  
Inspection Time ◽  
Free Form ◽  
Coordinate Measuring Machines ◽  
Ant Colony Optimization Algorithm ◽  
Measuring Machine ◽  
Free Form Surfaces

Abstract Coordinate measuring machines (CMMs) play an important role in modern manufacturing and inspection technologies. However, the inspection process of a CMM is recognized as time-consuming work. The low efficiency of coordinate measuring machines has given rise to new inspection strategies and methods, including path optimization. This study describes the optimization of an inspection path on free-form surfaces using three different algorithms: an ant colony optimization algorithm, a genetic algorithm, and a particle swarm optimization algorithm. The optimized sequence of sampling points is obtained in MATLAB R2020b software and tested on a Leitz Reference HP Bridge Type Coordinate Measuring Machine produced by HEXAGON. This study compares the performance of the three algorithms in theoretical and practical conditions. The results demonstrate that the use of the three algorithms can result in a collision-free path being found automatically and reduce the inspection time. However, owing to the different optimization methodologies, the optimized processes and optimized times of the three algorithms, as well as the optimized paths, are different. The results indicate that the ant colony algorithm has better performance for the path optimization of free-form surfaces.

Research on Application of Ant Colony Optimization

2014 ◽  
Vol 548-549 ◽  
pp. 1213-1216
Author(s):  
Wang Rui ◽  
Zai Tang Wang
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Optimal Algorithm ◽  
Convergence Speed ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Slow Convergence ◽  
Simulation Results ◽  
Research On Application

We research on application of ant colony optimization. In order to avoid the stagnation and slow convergence speed of ant colony algorithm, this paper propose the multiple ant colony optimization algorithm based on the equilibrium of distribution. The simulation results show that the optimal algorithm can have better balance in reducing stagnation and improving the convergence.

Parallel Ant Colony Optimization Algorithm Based on Multiplicate Pheromon Declining

2012 ◽  
Vol 433-440 ◽  
pp. 3577-3583
Author(s):  
Yan Zhang ◽  
Hao Wang ◽  
Yong Hua Zhang ◽  
Yun Chen ◽  
Xu Li
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Optimal Path ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Computing Power ◽  
Slow Convergence ◽  
The Impact

To overcome the defect of the classical ant colony algorithm’s slow convergence speed, and its vulnerability to local optimization, the authors propose Parallel Ant Colony Optimization Algorithm Based on Multiplicate Pheromon Declining to solve Traveling Salesman Problem according to the characteristics of natural ant colony multi-group and pheromone updating features of ant colony algorithm, combined with OpenMP parallel programming idea. The new algorithm combines three different pheromone updating methods to make a new declining pheromone updating method. It effectively reduces the impact of pheromone on the non-optimal path in the ants parade loop to subsequent ants and improves the parade quality of subsequent ants. It makes full use of multi-core CPU's computing power and improves the efficiency significantly. The new algorithm is compared with ACO through experiments. The results show that the new algorithm has faster convergence rate and better ability of global optimization than ACO.

Applied Research of Ant Colony Algorithm in Fault Diagnosis

2014 ◽  
Vol 1037 ◽  
pp. 353-356
Author(s):  
Shi Hong Bai ◽  
Li Rong Guang ◽  
Zhi Wei Liu
Keyword(s):  
Fault Diagnosis ◽  
Ant Colony Algorithm ◽  
Applied Research ◽  
Chemical Reactor ◽  
Production Equipment ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
High Quality ◽  
Diagnosis Model ◽  
Quality Approach

The ant colony optimization algorithm is applied in the fault diagnosis of the production equipment, on the basis of the study of it, the relative fault diagnosis model was established. According to the data of a kind of chemical reactor, the eight values of different state were extracted and used to train the fault diagnosis model. The result of the test is turned out to be accurate and the application of such a kind of algorithm is a high-quality approach to fault diagnosis.

Sign in / Sign up

Export Citation Format

Share Document