scholarly journals Tuning PID Controller Using Multiobjective Ant Colony Optimization

2012 ◽  
Vol 2012 ◽  
pp. 1-7 ◽  
Author(s):  
Ibtissem Chiha ◽  
Noureddine Liouane ◽  
Pierre Borne
Keyword(s):  
Genetic Algorithms ◽  
Ant Colony Optimization ◽  
Ant Colony Algorithm ◽  
Optimal Solution ◽  
Ant Colony ◽  
Pid Controllers ◽  
Tuning Method ◽  
Classic Approach ◽  
Optimum Solution ◽  
Multiobjective Ant Colony Optimization

This paper treats a tuning of PID controllers method using multiobjective ant colony optimization. The design objective was to apply the ant colony algorithm in the aim of tuning the optimum solution of the PID controllers (Kp,Ki, andKd) by minimizing the multiobjective function. The potential of using multiobjective ant algorithms is to identify the Pareto optimal solution. The other methods are applied to make comparisons between a classic approach based on the “Ziegler-Nichols” method and a metaheuristic approach based on the genetic algorithms. Simulation results demonstrate that the new tuning method using multiobjective ant colony optimization has a better control system performance compared with the classic approach and the genetic algorithms.

Application of Ant Colony Algorithm

2014 ◽  
Vol 548-549 ◽  
pp. 1217-1220
Author(s):  
Rui Wang ◽  
Zai Tang Wang
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony Algorithm ◽  
Optimal Solution ◽  
Ant Colony ◽  
Pheromone Concentration ◽  
Local Optimal Solution ◽  
Searching Ability ◽  
Excessive Accumulation

This paper mainly considers the application of the ant colony in our life. The principle of ant colony optimization, improves the performance of ant colony algorithm, and the global searching ability of the algorithm. We introduce a new adaptive factor in order to avoid falling into local optimal solution. With the increase the number of interations, this factor will benefit the ant search the edge with lower pheromone concentration and avoid the excessive accumulation of pheromone.

Application of Improved Ant Colony Optimization on Economical Operation of Automatic Generation Control Units in Hydropower Station

2013 ◽  
Vol 860-863 ◽  
pp. 2101-2106 ◽  
Author(s):  
Yi Fan Li ◽  
Ke Guan Wang ◽  
Chuan Li Gong
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony Algorithm ◽  
Optimal Solution ◽  
Automatic Generation ◽  
Ant Colony ◽  
Automatic Generation Control ◽  
Hydropower Station ◽  
Control Units ◽  
Convergence Performance ◽  
Generation Control

This paper proposed an improved ant colony optimization(ACO), to solve the economical operating dispatch of automatic generation control(AGC) units in hydropower station. The improved ant colony algorithm PSO-ACO imported particle swarm optimization is put forward. Both of the global convergence performance and the effectiveness of this algorithm is improved by using self-adaptive parameters and importing PSO to optimize the current ant paths. The mathematical description and procedure of the PSO-ACO are given with the maximum plant generating efficiency model as an example. Finally the superiority of the PSO-ACO is demonstrated by the application of AGC units on right bank of Three Gorges hydropower station. The optimal solution is more accurate and the calculation speed is higher than other methods.

scholarly journals Parameter Selection for Ant Colony Algorithm Based on Bacterial Foraging Algorithm

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Peng Li ◽  
Hua Zhu
Keyword(s):  
Ant Colony Algorithm ◽  
Optimal Solution ◽  
Parameter Selection ◽  
Ant Colony ◽  
Multidimensional Space ◽  
Bacterial Foraging ◽  
Operation Speed ◽  
Local Optimal Solution ◽  
Bacterial Foraging Algorithm ◽  
Selection For

The optimal performance of the ant colony algorithm (ACA) mainly depends on suitable parameters; therefore, parameter selection for ACA is important. We propose a parameter selection method for ACA based on the bacterial foraging algorithm (BFA), considering the effects of coupling between different parameters. Firstly, parameters for ACA are mapped into a multidimensional space, using a chemotactic operator to ensure that each parameter group approaches the optimal value, speeding up the convergence for each parameter set. Secondly, the operation speed for optimizing the entire parameter set is accelerated using a reproduction operator. Finally, the elimination-dispersal operator is used to strengthen the global optimization of the parameters, which avoids falling into a local optimal solution. In order to validate the effectiveness of this method, the results were compared with those using a genetic algorithm (GA) and a particle swarm optimization (PSO), and simulations were conducted using different grid maps for robot path planning. The results indicated that parameter selection for ACA based on BFA was the superior method, able to determine the best parameter combination rapidly, accurately, and effectively.

An Improved and Realized Volatility Strategy of the Ant Colony Optimization Algorithm

2013 ◽  
Vol 389 ◽  
pp. 849-853
Author(s):  
Fang Song Cui ◽  
Wei Feng ◽  
Da Zhi Pan ◽  
Guo Zhong Cheng ◽  
Shuang Yang
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Optimal Solution ◽  
Ant Colony ◽  
Ant System ◽  
Ant Colony Optimization Algorithm ◽  
Volatility Model ◽  
Local Optimal Solution ◽  
The Impact ◽  
Improved Algorithm

In order to overcome the shortcomings of precocity and stagnation in ant colony optimization algorithm, an improved algorithm is presented. Considering the impact that the distance between cities on volatility coefficient, this study presents an model of adjusting volatility coefficient called Volatility Model based on ant colony optimization (ACO) and Max-Min ant system. There are simulation experiments about TSP cases in TSPLIB, the results show that the improved algorithm effectively overcomes the shortcoming of easily getting an local optimal solution, and the average solutions are superior to ACO and Max-Min ant system.

Optimization of PID Controllers Using Ant Colony and Genetic Algorithms

2013 ◽  
Author(s):  
Muhammet Ünal ◽  
Ayça Ak ◽  
Vedat Topuz ◽  
Hasan Erdal
Keyword(s):  
Genetic Algorithms ◽  
Ant Colony ◽  
Pid Controllers

Hookes-Jeeves-Based Variant of Memetic Algorithm

2016 ◽  
pp. 450-475
Author(s):  
Dipti Singh ◽  
Kusum Deep
Keyword(s):  
Genetic Algorithms ◽  
Memetic Algorithm ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Memetic Algorithms ◽  
Global Optimum ◽  
Benchmark Problems ◽  
New Variant ◽  
Optimum Solution ◽  
Global Optimum Solution

Due to their wide applicability and easy implementation, Genetic algorithms (GAs) are preferred to solve many optimization problems over other techniques. When a local search (LS) has been included in Genetic algorithms, it is known as Memetic algorithms. In this chapter, a new variant of single-meme Memetic Algorithm is proposed to improve the efficiency of GA. Though GAs are efficient at finding the global optimum solution of nonlinear optimization problems but usually converge slow and sometimes arrive at premature convergence. On the other hand, LS algorithms are fast but are poor global searchers. To exploit the good qualities of both techniques, they are combined in a way that maximum benefits of both the approaches are reaped. It lets the population of individuals evolve using GA and then applies LS to get the optimal solution. To validate our claims, it is tested on five benchmark problems of dimension 10, 30 and 50 and a comparison between GA and MA has been made.

scholarly journals Multi-objective performance optimization of ORC cycle based on improved ant colony algorithm

Open Physics ◽  
2019 ◽  
Vol 17 (1) ◽  
pp. 48-59 ◽  
Author(s):  
Rong He ◽  
Xinli Wei ◽  
Nasruddin Hassan
Keyword(s):  
Performance Optimization ◽  
Ant Colony Algorithm ◽  
Optimal Solution ◽  
Second Law Of Thermodynamics ◽  
Optimization Method ◽  
Ant Colony ◽  
Multi Objective ◽  
Objective Performance ◽  
Performance Evaluation Index ◽  
Improved Ant Colony Algorithm

Abstract To solve the problem of multi-objective performance optimization based on ant colony algorithm, a multi-objective performance optimization method of ORC cycle based on an improved ant colony algorithm is proposed. Through the analysis of the ORC cycle system, the thermodynamic model of the ORC system is constructed. Based on the first law of thermodynamics and the second law of thermodynamics, the ORC system evaluation model is established in a MATLAB environment. The sensitivity analysis of the system is carried out by using the system performance evaluation index, and the optimal working parameter combination is obtained. The ant colony algorithm is used to optimize the performance of the ORC system and obtain the optimal solution. Experimental results show that the proposed multi-objective performance optimization method based on the ant colony algorithm for the ORC cycle needs a shorter optimization time and has a higher optimization efficiency.

Fleet optimization considering overcapacity and load sharing restrictions using genetic algorithms and ant colony optimization

2020 ◽  
Vol 34 (1) ◽  
pp. 104-113
Author(s):  
Fredy Kristjanpoller ◽  
Kevin Michell ◽  
Werner Kristjanpoller ◽  
Adolfo Crespo
Keyword(s):  
Ant Colony Optimization ◽  
Real World ◽  
Life Cycle Cost ◽  
Optimal Solution ◽  
Load Sharing ◽  
Ant Colony ◽  
Added Value ◽  
Fleet Size ◽  
Combined Use ◽  
Computing Performance

AbstractThis paper presents a fleet model explained through a complex configuration of load sharing that considers overcapacity and is based on a life cycle cost (LCC) approach for cost-related decision-making. By analyzing the variables needed to optimize the fleet size, which must be evaluated in combination with the event space method (ESM), the solution to this problem would normally require high computing performance and long computing times. Considering this, the combined use of an integer genetic algorithm (GA) and the ant colony optimization (ACO) method was proposed in order to determine the optimal solution. In order to analyze and highlight the added value of this proposal, several empirical simulations were performed. The results showed the potential strengths of the proposal related to its flexibility and capacity in solving large problems with a near optimal solution for large fleet size and potential real-world applications. Even larger problems can be solved this way than by using the complete enumeration approach and a non-family fleet approach. Thus, this allows for a more real solution to fleet design that also considers overcapacity, availability, and an LCC approach. The simulations showed that the model can be solved in much less time compared with the base model and allows for the resolution of a fleet of at least 64 trucks using GA and 130 using ACO, respectively. Thus, the proposed framework can solve real-world problems, such as the fleet design of mining companies, by offering a more realistic approach.

Improved Ant Colony Algorithm for Optimal Solution TSP

2013 ◽  
Vol 765-767 ◽  
pp. 699-702
Author(s):  
Tian Yuan Zhou
Keyword(s):  
Traveling Salesman Problem ◽  
Ant Colony Algorithm ◽  
Search Strategy ◽  
Optimal Solution ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Algorithm Analysis ◽  
Simulation Testing ◽  
The Traveling Salesman Problem ◽  
Improved Ant Colony Algorithm

Based on the ant colony algorithm analysis and research, this paper proposed an improved ant colony algorithm. Through updating pheromone and optimal search strategy, then applied to the Traveling Salesman Problem (TSP), effectively improved the searching capability of the algorithm. Finally through the simulation testing and analysis, verified that the improved ant colony algorithm is effective, and has good performance.

Sign in / Sign up

Export Citation Format

Share Document