Methods of optimization graph problems solution on the basis of genetic and developmental routines

As a solution of different practical problems, both of an engineering and economical nature, a special place is occupied with optimization problems grounded on classic graph algorithms, such as, for example, minimization of intersections and construction of flat piling of the graph, separation of internally and outwardly stable subsets, constructing the effective coloring problem of the graph, determination of cliques and cores of the graph, etc. In the paper the approach to a solution of a problem of constructing flat piling, and also a problem of separation in the graph of internally stable (independent) subsets is introduced on the basis of methods of genetic looking up. The designed algorithms have a straight-line characteristic of temporary complication. For studying genetic algorithms the system of the test problems (benchmarks) was designed, intended for matching GA with other techniques and the uniqueness of of GA capacity for problem solving of optimization is demonstrated.