Implementation of genetic algorithm for optimization of network route

3Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Problem in the real world requires modeling the problem mathematically and drawing conclusions based on the solutions of the mathematical problem. One of the alternatives is evolutionary computation, which encompasses three main components––evolution strategies, genetic algorithms, and evolution programs. Genetic algorithm takes a possible solution to a particular problem on a simple chromosome with variable genes and uses the data structure to apply the combination of operators to these structures in order to protect vital assets and search for optimum solutions. Shortest path routing algorithms are a well-established problem and addressed by many researchers in different ways. In the present work, one such algorithm was used for routing which is based on genetic algorithm.

Cite

CITATION STYLE

APA

Sharma, K. K., & Kaur, I. (2016). Implementation of genetic algorithm for optimization of network route. In Advances in Intelligent Systems and Computing (Vol. 381, pp. 7–14). Springer Verlag. https://doi.org/10.1007/978-81-322-2526-3_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free