Genetic Algorithm for Shortest Path Routing Problem

Charmy Pujara; AM Kothari

doi:10.37591/rrdms.v2i3.578

Research & Reviews: Discrete Mathematical Structures

Genetic Algorithm for Shortest Path Routing Problem

Abstract

This review paper presents a genetic algorithm approach to the shortest path routing problem. Its variable length chromosomes (string) and their genes (parameters) have been used for encoding the problem. The crossover operation exchanges partial routes.Cite this ArticlePujara Charmy, Kothari AM. Genetic algorithm for shortest path routing problem. Research & Reviews: Discrete Mathematical Structures. 2015; 2(3): 36–39p.

Keywords

Full text

The full text of this article is available to subscribers.

On a subscribing campus you are let in by network address, with no login at all.

Buy this article ₹1,500 $30

One-off purchase. Permanent access to this article, no account needed.

How to cite

Charmy Pujara, AM Kothari. Genetic Algorithm for Shortest Path Routing Problem. Research & Reviews: Discrete Mathematical Structures. 2015;2(3):36–39. https://doi.org/10.37591/rrdms.v2i3.578

Download the citation:

BibTeX RIS EndNote

Article details

Journal: Research & Reviews: Discrete Mathematical Structures
Issue: Volume 2, Issue 3 (2015)
Pages: 36–39
Published: Dec. 17, 2015
DOI: 10.37591/rrdms.v2i3.578

Publish with us

Submit your research to Research & Reviews: Discrete Mathematical Structures — peer-reviewed, open access options available.

Submit a manuscript →