Multi-core Deployment Optimization Using Simulated Annealing and Ant Colony Optimization

2013 ◽  
Author(s):  
Hamilton Turner ◽  
Jules White
Keyword(s):  
Simulated Annealing ◽  
Ant Colony Optimization ◽  
Ant Colony ◽  
Deployment Optimization

scholarly journals Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem

Entropy ◽  
2020 ◽  
Vol 22 (8) ◽  
pp. 884
Author(s):  
Petr Stodola ◽  
Karel Michenka ◽  
Jan Nohel ◽  
Marian Rybanský
Keyword(s):  
Simulated Annealing ◽  
Ant Colony Optimization ◽  
Traveling Salesman Problem ◽  
Optimization Problems ◽  
Dynamic Environment ◽  
Population Diversity ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Local Optimum ◽  
Use Of Knowledge

The dynamic traveling salesman problem (DTSP) falls under the category of combinatorial dynamic optimization problems. The DTSP is composed of a primary TSP sub-problem and a series of TSP iterations; each iteration is created by changing the previous iteration. In this article, a novel hybrid metaheuristic algorithm is proposed for the DTSP. This algorithm combines two metaheuristic principles, specifically ant colony optimization (ACO) and simulated annealing (SA). Moreover, the algorithm exploits knowledge about the dynamic changes by transferring the information gathered in previous iterations in the form of a pheromone matrix. The significance of the hybridization, as well as the use of knowledge about the dynamic environment, is examined and validated on benchmark instances including small, medium, and large DTSP problems. The results are compared to the four other state-of-the-art metaheuristic approaches with the conclusion that they are significantly outperformed by the proposed algorithm. Furthermore, the behavior of the algorithm is analyzed from various points of view (including, for example, convergence speed to local optimum, progress of population diversity during optimization, and time dependence and computational complexity).

Ant Colony Optimization for Factory Layout

2012 ◽  
Vol 591-593 ◽  
pp. 758-761
Author(s):  
Xiu Zeng ◽  
Qian Li Ma
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Ant Colony Optimization ◽  
Heuristic Algorithms ◽  
Mean Value ◽  
Ant Colony ◽  
Logistics Cost ◽  
The Mean ◽  
Factory Layout ◽  
Np Problem

Factory layout is NP problem[1]. There are many methods to solve it ,such as engineering diagram, flow chart method, various heuristic algorithms, SA( simulated annealing) and GA(genetic algorithm) [2].ACO (ant colony optimization) is used to solve it in this paper. The logistics costs exist between two workshops that are treated as pheromone that guides ants to search the best solution. Smaller logistics cost is, stronger the two workshops of relation is. In the process of optimization theworkshop with low logistics cost is more likely to be chosen, which minimizes the system logistics cost. Compared with GA, ACO has the advantage in speed. The mean value of the solution, the best solution, the worst solution is better too. More the number of workshop is, more obvious the superiority is.

Decline of Real Power Loss by the Combination of Ant Colony Optimization and Simulated Annealing Algorithm

2016 ◽  
Vol 23 ◽  
pp. 113-119 ◽  
Author(s):  
K. Lenin ◽  
B. Ravindhranath Reddy ◽  
M. Suryakalavathi
Keyword(s):  
Simulated Annealing ◽  
Ant Colony Optimization ◽  
Power Loss ◽  
Simulated Annealing Algorithm ◽  
Reactive Power ◽  
Test System ◽  
Ant Colony ◽  
Local Optimum ◽  
Real Power ◽  
Combined Algorithm

Combination of ant colony optimization (ACO) algorithm and simulated annealing (SA) algorithm has been done to solve the reactive power problem.In this proposed combined algorithm (CA), the leads of parallel, collaborative and positive feedback of the ACO algorithm has been used to apply the global exploration in the current temperature. An adaptive modification threshold approach is used to progress the space exploration and balance the local exploitation. When the calculation process of the ACO algorithm falls into the inactivity, immediately SA algorithm is used to get a local optimal solution. Obtained finest solution of the ACO algorithm is considered as primary solution for SA algorithm, and then a fine exploration is executed in the neighborhood. Very importantly the probabilistic jumping property of the SA algorithm is used effectively to avoid solution falling into local optimum. The proposed combined algorithm (CA) approach has been tested in standard IEEE 30 bus test system and simulation results show obviously about the better performance of the proposed algorithm in reducing the real power loss with control variables within the limits.

scholarly journals Ant Colony Optimization for Resolving Unit Commitment Issues by Considering Reliability Constraints

2019 ◽  
Vol 2 (4) ◽  
pp. 120
Author(s):  
Alan Abdu Robbi Afifi ◽  
Sarjiya Sarjiya ◽  
Yusuf Susilo Wijoyo
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Ant Colony Optimization ◽  
Reliability Index ◽  
Unit Commitment ◽  
Ant Colony ◽  
Complex Combination ◽  
Generator Scheduling ◽  
Index Combination

Unit Commitment or generator scheduling is one of complex combination issues aiming to obtain the cheapest generating power total costs. Ant Colony Optimization is proposed as a method to solve Unit Commitment issues because it has a better result convergence according to one of journals that reviews methods to solve Unit Commitment issues. Ant Colony Optimization modification into Nodal Ant Colony Optimization as well as addition of several elements are also conducted to overcome Ant Colony Optimization limitations in resolving Unit Commitment issues. Nodal Ant Colony Optimization simulations are then compared with Genetic Algorithm and Simulated Annealing methods which previously has similar simulations. Reliability index combination in a form of Loss of Load Probability and Expected Unserved Energy are also added as reliability constraints in the system. Comparison of three methods shows that Nodal Ant Colony Optimization is able to provide better results up to 0.08% cheaper than Genetic Algorithm or Simulated Annealing methods.

Gear Design Optimization Algorithms: A Review

2020 ◽  
Vol 27 (1) ◽  
Author(s):  
YO Usman ◽  
PO Odion ◽  
EO Onibere ◽  
AY Egwoh
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Design Optimization ◽  
Ant Colony Optimization ◽  
Optimization Algorithms ◽  
Optimization Techniques ◽  
Ant Colony ◽  
Design Parameters ◽  
Gear Design ◽  
Complex Design

Gearing is one of the most efficient methods of transmitting power from a source to its application with or without change of speed or direction. Gears are round mechanical components with teeth arranged in their perimeter. Gear design is complex design that involves many design parameters and tables, finding an optimal or near optimal solution to this complex design is still a major challenge. Different optimization algorithms such as Genetic Algorithm (GA), Simulated Annealing, Ant-Colony Optimization, and Neural Network etc., have been used for design optimization of the gear design problems. This paper focuses on the review of the optimization techniques used for gear design optimization with a view to identifying the best of them. Nowadays, the method used for the design optimization of gears is the evolutionary algorithm specifically the genetic algorithm which is based on the evolution idea of natural selection. The study revealed that GA. has the ability to find optimal solutions in a short time of computation by making a global search in a large search space. Keywords: Firefly Algorithm, Ant-Colony Optimization, Simulated Annealing, Genetic Algorithm, Gear design, Optimization, Particle Swarm Optimization Algorithm

Sign in / Sign up

Export Citation Format

Share Document