Multi-population genetic algorithms with immigrants scheme for dynamic shortest path routing problems in mobile ad hoc networks

Authors:
Hui Cheng;Shengxiang Yang
Affiliations:
Department of Computer Science, University of Leicester, Leicester, United Kingdom;Department of Computer Science, University of Leicester, Leicester, United Kingdom
Venue:
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
Year:
2010

Citing 9
Cited 1

An iterative algorithm for delay-constrained minimum-cost multicasting

IEEE/ACM Transactions on Networking (TON)
Experimental study on population-based incremental learning algorithms for dynamic optimization problems

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Forking genetic algorithms: Gas with search space division schemes

Evolutionary Computation
Statistical properties analysis of real world tournament selection in genetic algorithms

Applied Intelligence
Solving shortest path problem using particle swarm optimization

Applied Soft Computing
Genetic algorithms with memory-and elitism-based immigrants in dynamic environments

Evolutionary Computation
A genetic-inspired multicast routing optimization algorithm with bandwidth and end-to-end delay constraints

ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III
A genetic algorithm for shortest path routing problem and the sizing of populations

IEEE Transactions on Evolutionary Computation
Population-Based Incremental Learning With Associative Memory for Dynamic Environments

IEEE Transactions on Evolutionary Computation

A novel multi-swarm algorithm for optimization in dynamic environments based on particle swarm optimization

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile ad hoc network (MANET), wireless mesh network, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, that is, the network topology changes over time due to energy conservation or node mobility. Therefore, the SP problem turns out to be a dynamic optimization problem in mobile wireless networks. In this paper, we propose to use multi-population GAs with immigrants scheme to solve the dynamic SP problem in MANETs which is the representative of new generation wireless networks. The experimental results show that the proposed GAs can quickly adapt to the environmental changes (i.e., the network topology change) and produce good solutions after each change.