الفهرس 
introductionOnly 14 pages are availabe for public view
 |  | from | 114 |  |  |
| | | from | 114 | | |
Abstract
Genetic Algorithms are a global optimization technique based on the operations observed in natural selection and genetics. They operate on string stnlctures, typically a list of digits represcnting a coding oflhe parameters for a given
problem.
The selection of optil11al network topology is a
hard combinatorial problem so that the classical en u mera ti 0 n- based meth od s grow ex pon enti ally with network sizc .Inthis rcscarch a ncw approach based on genetic algorithm (GA) is introduced to solve this problem. The proposed algorithm depends, upon using the simple genetic Algorithm (SGA)
after applying adaptive comprehensive information deformation to increase performance of SGA.
H\ustrative examples are included.