The optimization problem is to select the best of many possible design alternatives in a complex design space.
Genetic algorithms, one of numerous techniques to search optimal solution, have been sucessfully applied to various problems (for example, ...
The optimization problem is to select the best of many possible design alternatives in a complex design space.
Genetic algorithms, one of numerous techniques to search optimal solution, have been sucessfully applied to various problems (for example, parameter tuning in expert systems, structural systems with a mix of continuous, integer and discrete design variables) that could not have been readily solved with more conventional computational technique. But, conventional genetic algorithms are ill defined for two classes of problems ie. parameter convergence and penalty function.
Therefore, this paper develops improved genetic algorithms to solve these problems. As a case study, numerical examples are demonstrated to show the effectiveness of the improved genetic algorithms.