A Review on Evolutionary Multiobjective Optimization for Routing Problem of Computer Networks

Abstract

Evolutionary Algorithms are the stochastic optimization methods, simulating the behavior of natural evolution. These algorithms are basically population based search procedures efficiently dealing with complex search spaces having robust and powerful search mechanism. EAs are highly applicable in multiobjective optimization problem which are having conflicting objectives. Resource optimization in computer network is an important research problem and it can be easily handled by the use of multiobjective optimization approach. This paper reviews the work carried out for optimization in network routing.

MEANDS: A Many-objective Evolutionary Algorithm based on Non-dominated Decomposed Sets applied to multicast routing

“…There is a large amount of research dedicated to applying evolutionary-based methods on MRP and its variants; a survey is available elsewhere [44]. In the following we summarize research that in most of the cases employs a representation of individuals that is close to that of routing output, i.e.…”