A genetic algorithm for shortest path routing problem and the sizing of populations

This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for encoding the problem. The crossover operation exchanges partial chromosomes (partial routes) at positionally independent crossing sites and the mutation operation maintains the genetic diversity of the population. The proposed algorithm can cure all the infeasible chromosomes with a simple repair function. Crossover and mutation together provide a search capability that results in improved quality of solution and enhanced rate of convergence. This paper also develops a population-sizing equation that facilitates a solution with desired quality. It is based on the gambler ruin model; the equation has been further enhanced and generalized. The equation relates the size of the population, quality of solution, cardinality of the alphabet, and other parameters of the proposed algorithm. Computer simulations show that the proposed algorithm exhibits a much better quality of solution (route optimality) and a much higher rate of convergence than other algorithms. The results are relatively independent of problem types for almost all source-destination pairs. Furthermore, simulation studies emphasize the usefulness of the population-sizing equation. The equation scales to larger networks. It is felt that it can be used for determining an adequate population size in the SP routing problem.

[1]  David E. Goldberg,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.

[2]  Chung Gu Kang,et al.  Efficient clustering-based routing protocol in mobile ad-hoc networks , 2002, Proceedings IEEE 56th Vehicular Technology Conference.

[3]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[4]  David E. Goldberg,et al.  Genetic Algorithms and the Variance of Fitness , 1991, Complex Syst..

[5]  David H. Wolpert,et al.  Bandit problems and the exploration/exploitation tradeoff , 1998, IEEE Trans. Evol. Comput..

[6]  K. Yamasaki,et al.  A dynamic routing control based on a genetic algorithm , 1993, IEEE International Conference on Neural Networks.

[7]  Yee Leung,et al.  A genetic algorithm for the multiple destination routing problems , 1998, IEEE Trans. Evol. Comput..

[8]  Miki Haseyama,et al.  A genetic algorithm for determining multiple routes and its applications , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[9]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[10]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[11]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[12]  박재현.  Open Shortest Path First Protocol을 위한 대수적 형식 명세 및 분석 , 2003 .

[13]  Charles L. Hedrick,et al.  Routing Information Protocol , 1988, RFC.

[14]  Masaharu Munetomo,et al.  A migration scheme for the genetic adaptive routing algorithm , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[15]  Gunnar Tufte,et al.  Prototyping a GA Pipeline for complete hardware evolution , 1999, Proceedings of the First NASA/DoD Workshop on Evolvable Hardware.

[16]  William Stallings,et al.  High-Speed Networks: TCP/IP and ATM Design Principles , 1998 .

[17]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[18]  I. Y. Wang,et al.  The bandwidth allocation of ATM through genetic algorithm , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[19]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[20]  Dong-Chul Park,et al.  A neural network based multi-destination routing algorithm for communication network , 1998, 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227).

[21]  David B. Fogel,et al.  Evolving an expert checkers playing program without using human expertise , 2001, IEEE Trans. Evol. Comput..

[22]  Qingfu Zhang,et al.  An orthogonal genetic algorithm for multimedia multicast routing , 1999, IEEE Trans. Evol. Comput..

[23]  Faouzi Kamoun,et al.  Neural networks for shortest path computation and routing in computer networks , 1993, IEEE Trans. Neural Networks.

[24]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[25]  M. E. Mostafa,et al.  A genetic algorithm for joint optimization of capacity and flow assignment in packet switched networks , 2000, Proceedings of the Seventeenth National Radio Science Conference. 17th NRSC'2000 (IEEE Cat. No.00EX396).

[26]  강인혜,et al.  [서평]High-Speed Networks : TCP/IP and ATM Design Principles , 1999 .

[27]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[28]  Chen Changjia,et al.  A genetic algorithm for multicasting routing problem , 2000, WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420).

[29]  Chung G. Kang,et al.  Shortest path routing algorithm using Hopfield neural network , 2001 .