Journal Article10.14445/22315381/IJETT-V67I12P213
A Genetic Algorithm for Optimal Path Routing in Computer Networks
About: This article is published in international journal of engineering trends and technology. The article was published on 25 Dec 2019. The article focuses on the topics: Path (graph theory) & Routing (electronic design automation).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
TL;DR: This paper presents crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with different representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation.
•Dissertation
Improving performance of genetic algorithms by using novel fitness functions
Jason Cooper
- 01 Jan 2006
TL;DR: This thesis introduces Intelligent Fitness Functions and Partial Fitness Functions both of which can improve the performance of a genetic algorithm which is limited to a fixed run time.
A genetic algorithm for shortest path routing problem and the sizing of populations
Chang Wook Ahn,R. S. Ramakrishna +1 more
TL;DR: A population-sizing equation based on the gambler ruin model that can be used for determining an adequate population size in the shortest path (SP) routing problem and exhibits a much better quality of solution and a much higher rate of convergence than other algorithms.