A genetic algorithm for finding the k shortest paths in a network

Egyptian Informatics Journal

Volumn 11, Issue 2, 2010, Pages 75-79

  Hamed, Ahmed Younes ^a  

^a Sohag University   (Egypt)

Author keywords

Computer networks; Genetic algorithms; Multimedia; Shortest paths

Indexed keywords

BANDWIDTH; COMPUTER NETWORKS; GRAPH THEORY; NETWORK ROUTING;

BANDWIDTH CONSTRAINT; CONNECTION MATRICES; CONVENTIONAL ALGORITHMS; MULTIMEDIA; MULTIMEDIA APPLICATIONS; MULTIMEDIA MULTICAST; MULTIPLE DESTINATIONS; SHORTEST PATH;

GENETIC ALGORITHMS;

EID: 78650276216     PISSN: 11108665     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eij.2010.10.004     Document Type: Article

References (20)

1. A. Bako, and P. Kas Determining the k-th shortest path by matrix method Szigma 10 1977 61 66 [In Hungarian]
2. Brander AW, Sinclair MC. A comparative study of k-shortest path algorithms. In: Proc. 11th UK performance engineering workshop for computer and telecommunications Systems; September 1995.
3. Carraresi P, Sodini C. A binary enumeration tree to find K shortest paths. In: Proc. 7th Symp. operations research. p. 177-88. Athen̈aum/Hain/ Hanstein, Methods Oper. Res. 1983;45.
4. Consiglio A, Pecorella A. Using simulated annealing to solve the K-shortest path problem. In: Proc. conf. Italian assoc. operations research; September 1995.
5. Fox BL. K-th shortest paths and applications to the probabilistic networks. In: ORSA/TIMS joint national meeting, vol.23; 1975. p. B263.
6. G.J. Horne Finding the K least cost paths in an acyclic activity network J Oper Res Soc 31 1980 443 448
7. N. Katoh, T. Ibaraki, and H. Mine An O.Kn2/ algorithm for K shortest simple paths in an undirected graph with nonnegative arc length Trans Inst Electron Commun Eng Jpn E61 1978 971 972 (Pubitemid 11452709)
8. N. Katoh, T. Ibaraki, and H. Mine An efficient algorithm for K shortest simple paths Networks 12 4 1982 411 427 (Pubitemid 13488127)
9. N. Kumar, and R.K. Ghosh Parallel algorithm for finding first K Shortest paths Comput Sci Inform 24 3 1994 21 28
10. Law AG, Rezazadeh A. Computing the K-shortest paths, under nonnegative weighting. In: Proc. 22nd Manitoba Conf. Numerical Mathematics and Computing, Congr. Numer., vol. 92; 1993. p. 277-80. (Pubitemid 24831879)
11. E.L. Lawler Comment on computing the k shortest paths in a graph Commun Assoc Comput Mach 20 1977 603 604
12. Minieka E. The K-th shortest path problem. In: ORSA/TIMS joint national meeting, vol. 23; 1975. p. B/116.
13. A. Perko Implementation of algorithms for K shortest loopless paths Networks 16 1986 149 160 (Pubitemid 16534153)
14. Ruppert E. Finding the k shortest paths in parallel. In: Proc. 14th symp. theoretical aspects of computer science; February 1997. (Pubitemid 127044174)
15. T. Shibuya Finding the k shortest paths by AI search techniques Cooperative Res Rep Model Algorithms 7 77 1995 212 222 [Inst. of Statical Mathematics]
16. Shier DR. Algorithms for finding the k shortest paths in a network. In: ORSA/TIMS joint national meeting; 1976. p. 115.
17. D.R. Shier Iterative methods for determining the k shortest paths in a network Networks 6 3 1976 205 229
18. D.R. Shier On algorithms for finding the k shortest paths in a network Networks 9 3 1979 195 214
19. M.M. Weigand A new algorithm for the solution of the k-th best route problem Computing 16 1976 139 151
20. Yen JY. Another algorithm for finding the K shortest-loop less network paths. In: Proc. 41st mtg. operations research society of America, vol. 20; 1972. p. B/185.