A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A Coarse-Grained Parallel Genetic Algorithm with Migration for Shortest Path Routing Problem
2009
2009 11th IEEE International Conference on High Performance Computing and Communications
Preserved Fulltext
In computer networks the routing is based on shortest path routing algorithms. Based on its advantages, an alternative method is used known as Genetic Algorithm based routing algorithm, which is highly scalable and insensitive to variations in network topology. Here we propose a coarse-grained parallel genetic algorithm to solve the shortest path routing problem with the primary goal of computation time reduction along with the use of migration scheme. This algorithm is developed and
doi:10.1109/hpcc.2009.25
dblp:conf/hpcc/YussofRSGD09
fatcat:qwujhwiskvbt3drpqsgpsmbikm