References

Ahn, C.W. and R.S. Ramakrishna, 2002. A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans. Evolut. Comput., 6: 566-579.
CrossRef  |  Direct Link  |  

Ahn, C.W., R.S. Ramakrishna, C.G. Kang and I.C. Choi, 2001. Shortest path routing algorithm using Hopfield neural network. Electron. Lett., 37: 1176-1178.
CrossRef  |  

Ali, M.M. and F. Kamoun, 1993. Neural networks for shortest path computation and routing in computer networks. IEEE Trans. Neural Netw., 4: 941-954.
PubMed  |  

Branke, J., 1999. Memory enhanced evolutionary algorithms for changing optimization problems. Proceedings of the Congress on Evolutionary Computation, Volume 3, July 6-9, 1999, Washington, DC., pp: 1875-1882.

Branke, J., 2002. Evolutionary Optimization in Dynamic Environments. Springer, USA., ISBN: 9780792376316, Pages: 208.

Branke, J., T. Kaussler, C. Schmidth and H. Schmuck, 2000. A multi-population approach to dynamic optimization problems. Proceedings of the 4th International Conference on Adaptive Computing in Design and Manufacture, July 8-12, 2000, Las Vegas, USA., pp: 299-308.

Cheng, H., X. Wang, S. Yang and M. Huang, 2009. A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks. Applied Soft Comput., 9: 677-684.
CrossRef  |  Direct Link  |  

Cobb, H.G. and J.J. Grefenstette, 1993. Genetic algorithms for tracking changing environments. Proceedings of 5th International Conference on Genetic Algorithms, June 1993, Urbana-Champaign, IL., USA., pp: 523-530.

Das, A. and C. Martel, 2009. Stochastic shortest path with unlimited hops. Inform. Process. Lett., 109: 290-295.
CrossRef  |  

Dasgupta, D. and D. McGregor, 1992. Nonstationary function optimization using the structured genetic algorithm. Proceedings of the 2nd International Conference on Parallel Problem Solving from Nature, September 28-30, 1992, Brussels, Belgium, pp: 145-154.

Din, D., 2005. Anycast routing and wavelength assignment problem on WDM network. IEICE Trans. Commun., E88: 3941-3951.

Grefenstette, J.J., 1992. Genetic algorithms for changing environments. Proceedings of the 2nd International Conference on Parallel Problem Solving from Nature, September 28-30, 1992, Brussels, Belgium, pp: 137-144.

Karaboga, D. and B. Basturk, 2008. On the performance of Artificial Bee Colony (ABC) algorithm. Applied Soft Comput., 8: 687-697.
CrossRef  |  Direct Link  |  

Karaboga, D., 2005. An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department, Kayseri, Turkey, October 2005. http://mf.erciyes.edu.tr/abc/pub/tr06_2005.pdf.

Lee, S., S. Soak, K. Kim, H. Park and M. Jeon, 2008. Statistical properties analysis of real world tournament selection in genetic algorithms. Applied Intell., 28: 195-205.
CrossRef  |  Direct Link  |  

Lewis, E. and G. Ritchie, 1998. A comparison of dominance mechanisms and simple mutation on non-stationary problems. Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, September 27-30, 1998, Amsterdam, The Netherlands, pp: 139-148.

Mohemmed, A.W., N.C. Sahoo and T.K. Geok, 2008. Solving shortest path problem using particle swarm optimization. Applied Soft Comput., 8: 1643-1653.
CrossRef  |  

Mori, H. and Y. Nishikawa, 1997. Adaptation to changing environments by means of the memory based thermodynamical genetic algorithm. Proceedings of the 7th International Conference on Genetic Algorithms, July 19-23, 1997, East Lansing, MI, USA., pp: 299-306.

Morrison, R.W. and K.A. De Jong, 2000. Triggered hypermutation revisited. Proceedings of the Congress on Evolutionary Computation, Volume 2, July 16-19, 2000, La Jolla, CA., pp: 1025-1032.

Morrison, R.W., 2004. Designing Evolutionary Algorithms for Dynamic Environments. Springer-Verlag, Berlin, Germany, ISBN: 9783540212317, Pages: 148.

Oh, S., C. Ahn and R. Ramakrishna, 2006. A genetic-inspired multicast routing optimization algorithm with bandwidth and end-to-end delay constraints. Proceedings of the 13th International Conference on Neural Information Processing, October 3-6, 2006, Hong Kong, China, pp: 807-816.

Oppacher, F. and M. Wineberg, 1999. The shifting balance genetic algorithm: Improving the GA in a dynamic environment. Proceedings of the Genetic and Evolutionary Computation Conference, Volume 1, July 13-17, 1999, Orlando, Florida, USA., pp: 504-510.

Parrott, D. and L. Xiaodong, 2006. Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Trans. Evol. Comput., 10: 440-458.
CrossRef  |  

Parsa, M., Q. Zhu and J.J. Garcia-Luna-Aceves, 1998. An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE/ACM Trans. Networking, 6: 461-474.
CrossRef  |  Direct Link  |  

Perkins, C.E., 2001. Ad Hoc Networking. Addison-Wesly, Boston, MA., USA.