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

Open Webpage

Thiago Fialho de Queiroz Lafetá, Marcos L. P. Bueno, Christiane Regina Soares Brasil, Gina M. B. Oliveira

Published: 01 Jan 2018, Last Modified: 02 Apr 2025Appl. Soft Comput. 2018EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•MEANDS is proposed: Many-objective Evolutionary Algorithm based on Non-dominated Decomposed Sets.•MEANDS is tailored to deal with discrete optimization problems with many objectives.•MEANDS decomposes the original multi-objective problem (MOP) into simpler MOPs.•An environment based on MEANDS is built to solve multicast routing problem (MRP).•The performance of MEANS was compared to six other MOEAs in MRP with 4–6 QoS objectives: MEAMT, SPEA2, SPEA2+SDE, MOEA/D, MOEA/DD and NSGA-III.