Output details

Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks

<22> There are three key contributions in this paper. 1) A novel general model for dynamic network optimisation problems is formulated. 2) Dynamic genetic algorithms (GAs), i.e., GAs enhanced with immigrants and memory schemes, are developed for solving the dynamic shortest path routing problem. 3) Dynamic network and test environments are constructed which incorporate both cyclic and acyclic topological changes. Simulation experiments show that these dynamic GAs can quickly adapt to environmental changes and produce high-quality solutions after each change. These models and algorithms have widely stimulated the research in both the network optimisation and artificial intelligence areas.