Malaysian Journal of Computer Science (ISSN 0127-9084)
Indexing Page
Visit the official web site at http://ejum.fsktm.um.edu.my

Article Information
Title:A Genetic Algorithm Solution to Solve the Shortest Path Problem in OSPF and MPLS
Auhtor(s): Selvanathan Narainasamy ,Wee Jing Tee ,
Journal:Malaysian Journal of Computer Science (ISSN 0127-9084)
Volume:16, No 1
Year:2003
Keywords:OSPF, MPLS, Genetic, Chromosome, Mutation, Crossover
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.
File:Download

Volume Listing