Cícero Garrozi

Learn More
We solve a multicast routing problem by means of a genetic algorithm (GA) without using multicast trees. The source-destination routes need to fulfill two conflicting objectives: maximization of the common links and minimization of the route sizes. The proposed GA can be characterized by its representation of network links and routes in a variable size(More)
Classical approaches of multicast routing consider a tree path whose computational cost entails high use of resources such time and memory in the optimization process. This paper presents a genetic algorithm model applied to the multicast routing problem, in which no tree is built. The solution aims to maximize common paths in source-destinations routes and(More)
In recent years, many evolutionary algorithms approaches were introduced to improve existing algorithms as well as to solve optimization and search for problems. Problems involving the optimization of many objectives require a set of optimal solutions known as Pareto frontier. Unfortunately, similarly to single objective Evolutionary Algorithms, the(More)
  • 1