Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 40, Issue 1, 2010, Pages 52-63

  Yang, Shengxiang ^a   Cheng, Hui ^a   Wang, Fang ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b BT Group   (United Kingdom)

Author keywords

Dynamic optimization problem (DOP); Dynamic shortest path routing problem (DSPRP); Genetic algorithm (GA); Immigrants scheme; Memory scheme; Mobile ad hoc network (MANET)

Indexed keywords

ARTIFICIAL NEURAL NETWORK; DYNAMIC OPTIMIZATION PROBLEMS; DYNAMIC SHORTEST PATH; DYNAMIC SHORTEST PATH ROUTING PROBLEM (DSPRP); ENVIRONMENTAL CHANGE; HIGH-QUALITY SOLUTIONS; INTELLIGENT OPTIMIZATION TECHNIQUE; MEMORY SCHEMES; MOBILE NETWORKS; MOBILE WIRELESS NETWORK; NETWORK TOPOLOGY; NODE MOBILITY; ROUTING PROBLEMS; SHORTEST PATH; TARGET SYSTEMS; WIRELESS COMMUNICATIONS;

ACCESS CONTROL; DYNAMIC ROUTING ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; GENETIC ALGORITHMS; MOBILE AD HOC NETWORKS; MOBILE TELECOMMUNICATION SYSTEMS; NEURAL NETWORKS; PARTICLE SWARM OPTIMIZATION (PSO); TELECOMMUNICATION LINKS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC NETWORKS;

EID: 73049087609     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2009.2023676     Document Type: Article

References (45)

1. C. W. Ahn, R. S. Ramakrishna, C. G. Kang, and I. C. Choi, "Shortest path routing algorithm using Hopfield neural network," Electron. Lett., vol.37, no.19, pp. 1176-1178, Sep. 2001.
2. C. W. Ahn and R. S. Ramakrishna, "A genetic algorithm for shortest path routing problem and the sizing of populations," IEEE Trans. Evol. Comput., vol.6, no.6, pp. 566-579, Dec. 2002.
3. M. K. Ali and F. Kamoun, "Neural networks for shortest path computation and routing in computer networks," IEEE Trans. Neural Netw., vol.4, no.6, pp. 941-954, Nov. 1993.
4. J. Branke, "Memory enhanced evolutionary algorithms for changing optimization problems," in Proc. 1999 Congr. Evol. Comput., pp. 1875-1882.
5. J. Branke, Evolutionary Optimization in Dynamic Environments. Norwell, MA: Kluwer, 2002.
6. J. Branke, T. Kaußler, C. Schmidt, and H. Schmeck, "A multi-population approach to dynamic optimization problems," in Proc. 4th Int. Conf. Adaptive Comput. Des. Manuf., 2000, pp. 299-308.
7. H. Cheng, X. Wang, S. Yang, and M. Huang, "A multipopulation parallel genetic simulated annealing based QoS routing and wavelength assignment integration algorithm for multicast in optical networks," Appl. Soft Comput., vol.9, no.2, pp. 677-684, Mar. 2009.
8. H. G. Cobb and J. J. Grefenstette, "Genetic algorithms for tracking changing environments," in Proc. 5th Int. Conf. Genet. Algorithms, 1993, pp. 523-530.
9. D. Dasgupta and D. McGregor, "Nonstationary function optimization using the structured genetic algorithm," in Proc. 2nd Int. Conf. Parallel Problem Solving Nature, 1992, pp. 145-154.
10. A. Das and C. Martel, "Stochastic shortest path with unlimited hops," Inf. Process. Lett., vol.109, no.5, pp. 290-295, 2009.
11. D. Din, "Anycast routing and wavelength assignment problem on WDM network," IEICE Trans. Commun., vol.E88-B, no.10, pp. 3941-3951, Oct. 2005.
12. J. J. Grefenstette, "Genetic algorithms for changing environments," in Proc. 2nd Int. Conf. Parallel Problem Solving Nature, 1992, pp. 137-144.
13. S. Lee, S. Soak, K. Kim, H. Park, and M. Jeon, "Statistical properties analysis of real world tournament selection in genetic algorithms," Appl. Intell., vol.28, no.2, pp. 195-2205, Apr. 2008.
14. E. Lewis and G. Ritchie, "A comparison of dominance mechanisms and simple mutation on non-stationary problems," in Proc. 5th Int. Conf. Parallel Problem Solving Nature, 1998, pp. 139-148.
15. S. Louis and Z. Xu, "Genetic algorithms for open shop scheduling and re-scheduling," in Proc. 11th ISCA Int. Conf. Comput. Appl., 1996, pp. 99-102.
16. S. Misra and B. J. Oommen, "GPSPA: A new adaptive algorithm for maintaining shortest path routing trees in stochastic networks," Int. J. Commun. Syst., vol.17, no.10, pp. 963-984, 2004.
17. A. W. Mohemmed, N. C. Sahoo, and T. K. Geok, "Solving shortest path problem using particle swarm optimization," Appl. Soft Comput., vol.8, no.4, pp. 1643-1653, Sep. 2008.
18. H. Mori and Y. Nishikawa, "Adaptation to changing environments by means of the memory based thermodynamical genetic algorithm," in Proc. 7th Int. Conf. Genet. Algorithms, 1997, pp. 299-306.
19. R. W. Morrison, Designing Evolutionary Algorithms for Dynamic Environments. Berlin, Germany: Springer-Verlag, 2004.
20. R. W. Morrison and K. A. De Jong, "Triggered hypermutation revisited," Proc. 2000 Congr. Evol. Comput., vol.2, pp. 1025-1032.
21. S. Oh, C. Ahn, and R. Ramakrishna, "A genetic-inspired multicast routing optimization algorithm with bandwidth and end-to-end delay constraints," in Proc. 13th Int. Conf. Neural Inf. Process. (Lecture Notes in Computer Science), 2006, vol.4234, pp. 807-816.
22. F. Oppacher and M. Wineberg, "The shifting balance genetic algorithm: Improving the GA in a dynamic environment," Proc. 1999 Genet. Evol. Comput. Conf., vol.1, pp. 504-510.
23. D. Parrott and X. Li, "Locating and tracking multiple dynamic optima by a particle swarm model using speciation," IEEE Trans. Evol. Comput., vol.10, no.4, pp. 440-458, Aug. 2006.
24. M. Parsa, Q. Zhu, and J. Garcia-Luna Aceves, "An iterative algorithm for delay-constrained minimum-costmulticasting," IEEE/ACMTrans. Netw., vol.6, no.4, pp. 461-474, Aug. 1998.
25. C. E. Perkins Ed., Ad Hoc Networking. London, U.K.: Addison-Wesley, 2001.
26. C. S. R. Murthy and B. S. Manoj, Ad HocWireless Networks: Architectures and Protocols. Englewood Cliffs, NJ: Prentice-Hall, 2004.
27. R. Tinos and S. Yang, "A self-organizing random immigrants genetic algorithm for dynamic optimization problems," Genet. Program. Evol. Mach., vol.8, no.3, pp. 255-286, Sep. 2007. (Pubitemid 47255802)
28. C.-K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems. Englewood Cliffs, NJ: Prentice-Hall, 2002.
29. K. Trojanowski and Z. Michalewicz, "Searching for optima in nonstationary environments," in Proc. 1999 Congr. Evol. Comput., vol.3, pp. 1843-1850.
30. K. Trojanowski and Z. Michalewicz, "Evolutionary optimization in nonstationary environments," J. Comput. Sci. Technol., vol.1, no.2, pp. 93-124, 2000.
31. A. Uyar and A. Harmanci, "A new population based adaptive dominance change mechanism for diploid genetic algorithms in dynamic environments," Soft Comput., vol.9, no.11, pp. 803-815, Nov. 2005.
32. F. Vavak and T. C. Fogarty, "A comparative study of steady state and generational genetic algorithms for use in nonstationary environments," in Proc. AISB Workshop Evol. Comput., 1996, pp. 297-304.
33. Y. Xu, S. Salcedo Sanz, and X. Yao, "Metaheuristic approaches to traffic grooming inWDM optical networks," Int. J. Comput. Intell. Appl., vol.5, no.2, pp. 231-249, Jun. 2005.
34. S. Yang, "Memory-based immigrants for genetic algorithms in dynamic environments," in Proc. 2005 Genet. Evol. Comput. Conf., vol.2, pp. 1115-1122.
35. S. Yang, "Population-based incremental learning with memory scheme for changing environments," in Proc. 2005 Genet. Evol. Comput. Conf., vol.1, pp. 711-718.
36. S. Yang, "Genetic algorithms with elitism-based immigrants for changing optimization problems," in Proc. EvoWorkshops 2007: Appl. Evol. Comput. (Lecture Notes in Computer Science), vol.4448, pp. 627-636.
37. S. Yang, "Genetic algorithms with memory- and elitism-based immigrants in dynamic environments," Evol. Comput., vol.16, no.3, pp. 385-416, Sep. 2008.
38. S. Yang, Y.-S. Ong, and Y. Jin, Eds., Evolutionary Computation in Dynamic and Uncertain Environments. Berlin, Germany: Springer-Verlag, 2007.
39. S.Yang and H. Richter, "Hyper-learning for population-based incremental learning in dynamic environments," in Proc. 2009 Congr. Evol. Comput., pp. 682-689.
40. S.Yang and R. Tinos, "Ahybrid immigrants scheme for genetic algorithms in dynamic environments," Int. J. Autom. Comput., vol.4, no.3, pp. 243-254, Jul. 2007.
41. S. Yang and R. Tinos, "Hyper-selection in dynamic environments," in Proc. 2008 Congr. Evol. Comput., pp. 3185-3192.
42. S.Yang andX.Yao, "Experimental study on population-based incremental learning algorithms for dynamic optimization problems," Soft Comput., vol.9, no.11, pp. 815-834, Nov. 2005.
43. S. Yang and X. Yao, "Population-based incremental learning with associative memory for dynamic environments," IEEE Trans. Evol. Comput., vol.12, no.5, pp. 542-561, Oct. 2008.
44. X. Yu, K. Tang, T. Chen, and X. Yao, "Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization," Memetic Comput., vol.1, no.1, pp. 3-24, Mar. 2009.
45. X. Yu, K. Tang, and X. Yao, "An immigrants scheme based on environmental information for genetic algorithms in changing environments," in Proc. 2008 Congr. Evol. Comput., pp. 1141-1147.