The Use of Genetic Algorithms in Distributed Computer Networks

Konstantin V. Kolesnikov, Anait R. Karapetyan

Abstract


Keywords: routing, hybrid genetic algorithms, graph optimizing, chromosomes, crossover, mutation, selection.

 

Annotation:The existing methods of use of the genetic algorithms for solving optimization tasks are presented. The possibility of formalization of the task of optimizing in distribution of adaptive computer network is studied. The computational complexity of genetic algorithm of optimizing in graph and its practical use is analysed.


Volltext:

PDF (Russian)

Literaturhinweise


Rosenberg RS. Simulation of genetic populations with biochemical properties: Mathematical Biosciences, 7; 223–257.

Schaffer JD. Multiple objective optimization with vector evaluated genetic algorithm: JJ. Grefenstete (Kd.): Genetic Algorithms and Their Applications. Proc. of the First Int. Conf. on Genetic Algorithms, Hillsdale, NJ: L. Eribaum, 1985; 93–100.

Bіlous RV. Features practical application of genetic algorithm to search for optimal ways graph: RV. Bіlous, SD. Pogorіly: Registration, data storage and processing, 2010, V. 12, № 2; 81-87.

Karapetyan AR, Kolesnikov KV, Kurkov AS. Neural network modelsof data delivery route optimization in dynamic networks: International Scientific Journal, 2015, №6; 44-55.

Karapetyan AR, Kolesnikov KV, Tsarenko TA. Genetic algorithms for optimization problems in multi-adaptive network routing data: Proceedings of the National Technical University "KPI", Collected Works. Series: New solutions in modern technologies. Kharkov, NTU "KPI", 2013, #56 (1029); 74-78.

Pogorіly SD. Genetic algorithm for solving the problem of routing in networks: SD. Pogorіly, RV. Bіlous: Problems of programming, 2010, №2-3, Special issue; 171-178.


Refbacks

  • Im Moment gibt es keine Refbacks