A Genetic Algorithm Solution to Solve the Shortest Path Problem in OSPF and MPLS

Main Article Content

N. Selvanathan
Wee Jing Tee

Abstract

This paper explores the potential of using genetic algorithm to solve the shortest path problem in Open Shortest Path First (OSPF) and Multi-protocol Label Switching (MPLS). The most critical task for developing a genetic algorithm to this problem is how to encode a path in a graph into a chromosome. The proposed approach has been tested on ten randomly generated problems with different weights. The experimental results are very encouraging and the algorithm can find the optimum solution rapidly with high probability.


 

Downloads

Download data is not yet available.

Article Details

How to Cite
Selvanathan, N., & Tee, W. J. (2003). A Genetic Algorithm Solution to Solve the Shortest Path Problem in OSPF and MPLS. Malaysian Journal of Computer Science, 16(1), 58–67. Retrieved from https://sare.um.edu.my/index.php/MJCS/article/view/6119
Section
Articles