Generalized multiobjective multitree model solution using MOEA

  • Authors:
  • Benjamín Barán;Ramon Fabregat;Yezid Donoso;Fernando Solano;Jose L. Marzo

  • Affiliations:
  • CNC, National University of Asuncion, Paraguay;IIiA, Universitat de Girona, Spain;Universidad del Norte, Colombia;IIiA, Universitat de Girona, Spain;IIiA, Universitat de Girona, Spain

  • Venue:
  • EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a previous paper a novel Generalized Multiobjective Multitree model (GMM-model) was proposed. This model considers for the first time multitree-multicast load balancing with splitting in a multiobjective context, whose mathematical solution is a whole Pareto optimal set that can include several results than it has been possible to find in the publications surveyed. To solve the GMM-model, in this paper a multi-objective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) is proposed. Experimental results considering up to 11 different objectives are presented for the well-known NSF network, with two simultaneous data flows.