GENETIC ALGORITHM FOR OPTIMIZATION PROBLEMS
Journal: International Journal of Engineering Sciences & Research Technology (IJESRT) (Vol.4, No. 5)Publication Date: 2015-05-30
Authors : C. Premalatha;
Page : 489-501
Keywords : Genetic algorithm; optimization methods; objective function; representation schema; randomized operator and optimal solution.;
Abstract
Decision making features occur in all fields of human activities such as science and technological and affect every sphere of our life. Normally, any engineering problem will have a large number of solutions out of which some are feasible an d some are non - feasible. The designer’s task is to get best solution out of the feasible solutions. The complete set of feasible solutions constitutes feasible design space and progress towards the optimal design. In such a case, genetic algorithms are goo d at taking larger, potentially huge search space and navigating them looking for optimal combinations of things and solutions that may not be find in a life time. Genetic algorithm unlike traditional optimization methods processes a number of designs at s ame time, uses randomized operators that improves search space with efficient result. This paper dealt with important aspects of GA that includes definition of objective function, representation schemas for solution variables and randomized operators. Thes e aspects drive the problem to optimal solution.
Other Latest Articles
- RESEARCH FEATURES OF MODELS OF ELECTRIC DRIVES SYSTEM WITH SWITCHING ELEMENTS IN SIMPOWERSYSTEMS
- DIAGNOSTICS OF ENERGY EFFICIENCY OF SYNCHRONOUS DRIVE
- ESTIMATION OF APPLICATION EFFICIENCY OF LOW-FREQUENCY VIRTUAL SOURCES FOR ELECTROMAGNETIC PARAMETERS OF INDUCTION MOTORS IDENTIFICATION
- IMPACT ASSESSMENT OF KPIS AND KQIS ON COMMUNICATION SERVICES PROVIDERS AND CUSTOMER SATISFACTION
- EVALUATION OF ELECTROMECHANICAL COMPLEX PARAMETERS BY ENERGY METHOD
Last modified: 2015-06-05 21:54:16