Solving large parameter optimization problems using genetic algorithms

Author(s):  
K Krishnakumar ◽  
R Swaminathan ◽  
S Garg ◽  
S Narayanaswamy
2008 ◽  
Vol 2008 ◽  
pp. 1-9 ◽  
Author(s):  
Jenn-Long Liu ◽  
Chao-Chun Chang

This study proposes an orthogonal momentum-type particle swarm optimization (PSO) that finds good solutions to global optimization problems using a delta momentum rule to update the flying velocity of particles and incorporating a fractional factorial design (FFD) via several factorial experiments to determine the best position of particles. The novel combination of the momentum-type PSO and FFD is termed as the momentum-type PSO with FFD herein. The momentum-type PSO modifies the velocity-updating equation of the original Kennedy and Eberhart PSO, and the FFD incorporates classical orthogonal arrays into a velocity-updating equation for analyzing the best factor associated with cognitive learning and social learning terms. Twelve widely used large parameter optimization problems were used to evaluate the performance of the proposed PSO with the original PSO, momentum-type PSO, and original PSO with FFD. Experimental results reveal that the proposed momentum-type PSO with an FFD algorithm efficiently solves large parameter optimization problems.


1995 ◽  
Vol 29 (4) ◽  
pp. 39-56 ◽  
Author(s):  
S. Hurley ◽  
L. Moutinho ◽  
N.M. Stephens

2013 ◽  
Vol 310 ◽  
pp. 609-613
Author(s):  
Ioana D. Balea ◽  
Radu Hulea ◽  
Georgios E. Stavroulakis

This paper presents an implementation of Eurocode load cases for discrete global optimization algorithm for planar structures based on the principles of finite element methods and genetic algorithms. The final optimal design is obtained using IPE sections chosen as feasible by the algorithm, from the available steel sections from industry. The algorithm is tested on an asymmetric planar steel frame with promising results.


Author(s):  
Hamidreza Salmani mojaveri

One of the discussed topics in scheduling problems is Dynamic Flexible Job Shop with Parallel Machines (FDJSPM). Surveys show that this problem because of its concave and nonlinear nature usually has several local optimums. Some of the scheduling problems researchers think that genetic algorithms (GA) are appropriate approach to solve optimization problems of this kind. But researches show that one of the disadvantages of classical genetic algorithms is premature convergence and the probability of trap into the local optimum. Considering these facts, in present research, represented a developed genetic algorithm that its controlling parameters change during algorithm implementation and optimization process. This approach decreases the probability of premature convergence and trap into the local optimum. The several experiments were done show that the priority of proposed procedure of solving in field of the quality of obtained solution and convergence speed toward other present procedure.


Sign in / Sign up

Export Citation Format

Share Document