Algorithms to Augment Diversity and Convergence in Multiobjective Multicast Flow Routing

Multicast transmission corresponds to send data to several destinations, often involving requirements of Quality of Service (QoS) and Traffic Engineering (TE). These multiple requirements lead to the need of optimizing a set of conflicting objectives subject to constraints. Starting from the well-known evolutionary algorithm SPEA2, two formulations for the Routing problem were considered, minimizing four objectives - maximum link utilization, total cost, maximum end-to-end delay and hops count - subject to a link capacity constraint. The key investigation performed here is about the incorporation of a mechanism to reduced repeated individuals along the population, evaluating three algorithms for such task. One of them (f_tm) is proposed on this study, whose results in six instances of the problem with five metrics to evaluate convergence and diversity goals, indicates that the evolutionary model based on SPEA2 using our algorithm had returned the better results.