Optimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Partic More
Optimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) seem very efficient to approach in these problems and became very popular. The efficiency of these methods against many new metaheuristic optimization algorithms has been proved in previous works, however a robust comparison between GA and PSO to solve noisy nonlinear problems has not been reported yet. Therefore, in this paper GA and PSO are adapted to find optimal solutions of some noisy mathematical models. Based on the obtained results, GA shows a promising potential in terms of number of iteration to converge and solutions found so far for either for optimization of low or elevated levels of noise.
Manuscript profile
