1 Genetic Algorithnis— oy EP ations and 8 [290] Newrat Networks, Fussy fest Issues for GA practitioners portant while applyin such as 2 GA to practical problems, namely The following issues are imy 1. Choosing basic implementat entation, ion issues (a) Repres: (b) Population size and mut (c) Selection, deletion policies, and (d) Cross over and mutation operators. ation rate, 2. Termination criterion 3. Performance and scalability ly as good as the evaluation functions (often a difficult task), 4. Solution is onl; Benefits of GA ‘The concept of genetic algorithms is 1. easy to understand, modular, separate from application, supports multi-objective optimization, good for noisy environment, 2. a 4 5. we always get an answer and the answer gets better with time, 6. inherently parallel and easily distributed, 7. there are many ways to speed up and improve a GA’s basic applications as knowledge about the problem domain is general, 8. casy to exploit for previous or alternate solutions, 9. flexible in forming building blocks for hybrid applications, and 10. has substantial history and range of use. When to use GA Genetic algorithm should be used in case, 1. alternate solutions are too slow or overly complicated, 2. need an exploratory tool to examine new approaches, 3. problem is similar to one that has already been successfully solved by using GA, 4. we want to hybridize with an existing solution, or, 5. benefits of GA technology meet key problem requirements. Table 9.14 gives the fields where GA is successfully applied. aM -*@PortGenetic Modelling 29 Table 9.14 GA applications Domains Application types Control Gas pipe line, pole balancing, missile evasion, pursuit Design Semi conductor layout, aircraft design, keyboard configuration, communication networks Scheduling Manufacturing, facility scheduling, resource allocation Robotics Trajectory planning Machine learning Designing neural networks, classification algorithms Signal processing Filter design Game playing Poker, checker, prisoner’s dilemma Combinatorial Set covering, travelling salesman, routing, bin packing, graph optimization colouring and partitioning