Generalized Multiobjective Multitree model solution using MOEA
dc.contributor.author
dc.date.accessioned
2013-10-01T13:17:06Z
dc.date.available
2013-10-01T13:17:06Z
dc.date.issued
2005
dc.identifier.issn
1790-0832
dc.identifier.uri
dc.description.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
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
World Scientific and Engineering Academy and Society
dc.relation.ispartof
© WSEAS Transactions on Information Science and Applications, 2005, vol. 2, p.12-18
dc.relation.ispartofseries
Articles publicats (D-ATC)
dc.rights
Tots els drets reservats
dc.subject
dc.title
Generalized Multiobjective Multitree model solution using MOEA
dc.type
info:eu-repo/semantics/article
dc.rights.accessRights
info:eu-repo/semantics/openAccess
dc.embargo.terms
Cap
dc.type.version
info:eu-repo/semantics/submittedVersion
dc.identifier.idgrec
011591
dc.identifier.eissn
2224-3402