  In Internet Routing, the static shortest path (SP) problem has been addressed
using well known intelligent optimization techniques like artificial neural
networks, genetic algorithms (GAs) and particle swarm optimization. Advancement
in wireless communication lead more and more mobile wireless networks, such as
mobile networks [mobile ad hoc networks (MANETs)] and wireless sensor networks.
Dynamic nature of the network is the main characteristic of MANET. Therefore,
the SP routing problem in MANET turns into dynamic optimization problem (DOP).
Here the nodes ae made aware of the environmental condition, thereby making it
intelligent, which goes as the input for GA. The implementation then uses GAs
with immigrants and memory schemes to solve the dynamic SP routing problem
(DSPRP) in MANETS. In our paper, once the network topology changes, the optimal
solutions in the new environment can be searched using the new immigrants or
the useful information stored in the memory. Results shows GA with new
immigrants shows better convergence result than GA with memory scheme.
