Hybrid Ant Colony Optimization, Genetic Algorithm, and Simulated Annealing for image contrast enhancement

Author(s):  
Pourya Hoseini ◽  
Mahrokh G. Shayesteh
2010 ◽  
Vol 31 (13) ◽  
pp. 1816-1824 ◽  
Author(s):  
Sara Hashemi ◽  
Soheila Kiani ◽  
Navid Noroozi ◽  
Mohsen Ebrahimi Moghaddam

2012 ◽  
Vol 591-593 ◽  
pp. 758-761
Author(s):  
Xiu Zeng ◽  
Qian Li Ma

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.


Author(s):  
Alan Abdu Robbi Afifi ◽  
Sarjiya Sarjiya ◽  
Yusuf Susilo Wijoyo

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.


2020 ◽  
Vol 27 (1) ◽  
Author(s):  
YO Usman ◽  
PO Odion ◽  
EO Onibere ◽  
AY Egwoh

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