Özet:

This paper introduces a new metaheuristic optimization method based on evolutionary algorithms to solve single-objective engineering optimization problems faster and more efficient. By considering constraints as a new objective function, problems turned to multi objective optimization problems. To avoid regular local optimum, different mutations and crossovers are studied and the best operators due their performances are selected as main operators of algorithm. Moreover, certain infeasible solutions can provide useful information about the direction which lead to best solution, so these infeasible solutions are defined on basic concepts of optimization and uses their feature to guide convergence of algorithm to global optimum. Dynamic interference of mutation and crossover are considered to prevent unnecessary calculation and also a selection strategy for choosing optimal solution is introduced. To verify the performance of the proposed algorithm, some CEC 2006 optimization problems which prevalently used in the literatures, are inspected. After satisfaction of acquired result by proposed algorithm on mathematical problems, four popular engineering optimization problems are solved. Comparison of results obtained by proposed algorithm with other optimization algorithms show that the suggested method has a powerful approach in finding the optimal solutions and exhibits significance accuracy and appropriate convergence in reaching the global optimum.

Anahtar Kelimeler: