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., 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.

Brownlee, J., 2011. Clever Algorithms: Nature-Inspired Programming Recipes. Jason Brownlee, USA., pp: 257-264.

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.

Gunes, M., U. Sorges and I. Bouazizi, 2002. ARA-The ant-colony based routing algorithm for MANETs. Proceedings of the ICPP Workshop on Ad Hoc Networks, August 18-21, 2002, IEEE Computer Society, Washington, DC., USA., pp: 79-85.

Kaur, D. and P.S. Mundra, 2012. Ant colony optimization: A technique used in finding shortest path. Int. J. Eng. Innovative Technol., 1: 122-124.
Direct Link  |  

Kevin, M.P., 2010. Bacterial Foraging optimization. Int. J. Swarm Intell. Res., 1: 1-16.

Mavrovouniotis, M. and S. Yang, 2011. Memory-based immigrants for ant colony optimization in changing environments. Proceedings of the International Conference on Applications of Evolutionary Computation, April 27-29, 2011, Torino, Italy, pp: 324-333.

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  |  

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

Yang, S. and X. Yao, 2008. Population-based incremental learning with associative memory for dynamic environments. IEEE Trans. Evol. Comput., 12: 542-561.
CrossRef  |  

Yang, S., 2008. Genetic algorithms with memory and estimed-based immigrants in dynamic environments. Evolutionary Computation, 16: 385-416.
Direct Link  |  

Yang, S., C. Hui and F. Wang, 2010. Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile Ad Hoc network. IEEE Trans. Syst. Man Cybernetics Part C: Appl. Rev., 40: 52-63.
CrossRef  |