MEANDS: A Many-objective Evolutionary Algorithm based on Non-dominated Decomposed Sets applied to multicast routing
[Display omitted] •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 bas...
Saved in:
| Published in: | Applied soft computing Vol. 62; pp. 851 - 866 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.01.2018
|
| Subjects: | |
| ISSN: | 1568-4946, 1872-9681 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | [Display omitted]
•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.
Evolutionary algorithms have emerged in the last twenty years as a powerful approach for dealing with multi-objective optimization problems (MOPs). Although classical multi-objective evolutionary algorithms (MOEAs), such as SPEA2 and NSGA-II, have been designed to manipulate any number of objectives, the results of their practical application to MOPs with more than three objectives revealed that they have limitations. Many-objective algorithms represent the novelty in MOEA research because they are specially designed to handle search spaces of high dimension. In this paper, a new evolutionary algorithm able to handle discrete optimization problems with many objectives is proposed, called Many-objective Evolutionary Algorithm based on Non-dominated Decomposed Sets (MEANDS). MEANDS decomposes the original MOP into several, simpler MOPs, for which sub-populations of non-dominated solutions are maintained and evolved together. MEANDS relaxes several restrictions of predecessor algorithms, such as the size of sub-populations and the need for weights in the lower dimension MOPs. Empirical results show that MEANDS was able to find better solutions than those from well-known MOEAs (NSGA-III, SPEA2, SPEA2+SDE, MOEA/D, MOEA/DD, and its predecessor MEAMT) in the multicast routing problem involving 4, 5, and 6 QoS-based objectives. |
|---|---|
| AbstractList | [Display omitted]
•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.
Evolutionary algorithms have emerged in the last twenty years as a powerful approach for dealing with multi-objective optimization problems (MOPs). Although classical multi-objective evolutionary algorithms (MOEAs), such as SPEA2 and NSGA-II, have been designed to manipulate any number of objectives, the results of their practical application to MOPs with more than three objectives revealed that they have limitations. Many-objective algorithms represent the novelty in MOEA research because they are specially designed to handle search spaces of high dimension. In this paper, a new evolutionary algorithm able to handle discrete optimization problems with many objectives is proposed, called Many-objective Evolutionary Algorithm based on Non-dominated Decomposed Sets (MEANDS). MEANDS decomposes the original MOP into several, simpler MOPs, for which sub-populations of non-dominated solutions are maintained and evolved together. MEANDS relaxes several restrictions of predecessor algorithms, such as the size of sub-populations and the need for weights in the lower dimension MOPs. Empirical results show that MEANDS was able to find better solutions than those from well-known MOEAs (NSGA-III, SPEA2, SPEA2+SDE, MOEA/D, MOEA/DD, and its predecessor MEAMT) in the multicast routing problem involving 4, 5, and 6 QoS-based objectives. |
| Author | Lafetá, Thiago Oliveira, Gina M.B. Bueno, Marcos L.P. Brasil, Christiane |
| Author_xml | – sequence: 1 givenname: Thiago surname: Lafetá fullname: Lafetá, Thiago email: fialhot@gmail.com organization: Department of Computer Science, Federal University of Uberlândia, Uberlândia, Brazil – sequence: 2 givenname: Marcos L.P. surname: Bueno fullname: Bueno, Marcos L.P. email: marcoslbueno@ufu.br organization: Department of Computer Science, Federal University of Uberlândia, Uberlândia, Brazil – sequence: 3 givenname: Christiane surname: Brasil fullname: Brasil, Christiane email: christiane.ufu@gmail.com organization: Department of Computer Science, Federal University of Uberlândia, Uberlândia, Brazil – sequence: 4 givenname: Gina M.B. surname: Oliveira fullname: Oliveira, Gina M.B. email: gina@facom.ufu.br organization: Department of Computer Science, Federal University of Uberlândia, Uberlândia, Brazil |
| BookMark | eNp9kMtuwyAQRVGVSk3S_kBX_IBdwE-qbqwkfUhJuki7RhjjFMuGCEik_H2x0lUXEYvLgM5o5szARBstAXjEKMYI509dzJ0RMUG4iBGNQ9yAKS4LEtG8xJNwz_IySmma34GZcx0KECXlFLjNqtoud8-wghuuz5GpOym8Okm4Opn-6JXR3J5h1e-NVf5ngDV3soFGw63RUWMGpbkPD0spzHAw499Oegf54dCrUHgDh2PvleDOQ2tCQ72_B7ct7518-Ms5-H5dfS3eo_Xn28eiWkciSVMfpSXGpKVhTJlhipIEp4iQOpykkYVMZJ7UlBcoSznFdVbUGW7qOs0QKhpSFG0yB-Wlr7DGOStbJpTn40rectUzjNgoj3VslMdGeQxRFiKg5B96sGoIJq5DLxdIhqVOSlrmhJJayEbZIJU1Rl3DfwForYtk |
| CitedBy_id | crossref_primary_10_1016_j_swevo_2019_100641 crossref_primary_10_1007_s11235_020_00679_5 crossref_primary_10_1016_j_simpat_2022_102591 crossref_primary_10_1016_j_asoc_2018_11_013 crossref_primary_10_1016_j_comnet_2018_08_015 crossref_primary_10_1017_S0269888924000079 crossref_primary_10_1109_TSMC_2018_2858843 crossref_primary_10_1016_j_eswa_2025_128149 crossref_primary_10_1016_j_ins_2019_05_002 crossref_primary_10_1109_TCYB_2022_3151793 crossref_primary_10_1016_j_actamat_2025_120945 crossref_primary_10_1016_j_asoc_2019_105588 |
| Cites_doi | 10.1109/TEVC.2013.2281535 10.1016/S0140-3664(97)00124-2 10.1007/978-3-540-31880-4_2 10.1109/TEVC.2012.2204403 10.1109/TPWRS.2004.840442 10.1109/TEVC.2010.2058117 10.1109/TEVC.2012.2185847 10.1109/TEVC.2014.2373386 10.1162/EVCO_a_00009 10.1162/EVCO_a_00075 10.1016/S0140-3664(00)00273-5 10.1002/jcc.23315 10.1016/j.asoc.2016.08.042 10.1109/TEVC.2013.2262178 10.1016/j.jnca.2013.08.003 10.1016/j.asoc.2015.01.052 10.1109/TEVC.2007.892759 10.1109/TEVC.2011.2161872 10.1007/s11042-014-2405-4 10.1162/evco.1994.2.3.221 10.1109/TEVC.2010.2093579 10.1109/TEVC.2013.2281533 10.1109/4235.996017 10.1007/s11235-013-9797-8 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier B.V. |
| Copyright_xml | – notice: 2017 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.asoc.2017.09.017 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-9681 |
| EndPage | 866 |
| ExternalDocumentID | 10_1016_j_asoc_2017_09_017 S1568494617305562 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 23M 4.4 457 4G. 53G 5GY 5VS 6J9 7-5 71M 8P~ AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W JJJVA KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SES SEW SPC SPCBC SST SSV SSZ T5K UHS UNMZH ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c344t-48112f9928e51903314022b2b23de7e3e63b9a7054a91b57b51dbb45007d277f3 |
| ISICitedReferencesCount | 17 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000418333500057&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1568-4946 |
| IngestDate | Sat Nov 29 03:05:33 EST 2025 Tue Nov 18 22:28:06 EST 2025 Fri Feb 23 02:24:50 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Multicast routing Multi-objective optimization Evolutionary algorithms Many-objective algorithms Metaheuristics Genetic algorithms |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c344t-48112f9928e51903314022b2b23de7e3e63b9a7054a91b57b51dbb45007d277f3 |
| OpenAccessLink | https://ars.els-cdn.com/content/image/1-s2.0-S1568494617305562-fx1_lrg.jpg |
| PageCount | 16 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_asoc_2017_09_017 crossref_primary_10_1016_j_asoc_2017_09_017 elsevier_sciencedirect_doi_10_1016_j_asoc_2017_09_017 |
| PublicationCentury | 2000 |
| PublicationDate | January 2018 2018-01-00 |
| PublicationDateYYYYMMDD | 2018-01-01 |
| PublicationDate_xml | – month: 01 year: 2018 text: January 2018 |
| PublicationDecade | 2010 |
| PublicationTitle | Applied soft computing |
| PublicationYear | 2018 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Brasil, Delbem, da Silva (bib0095) 2013; 34 Crichigno, Barán (bib0025) 2004 Hadka, Reed (bib0160) 2013; 21 Koyama, Barolli, Matsumoto, Apduhan (bib0005) 2004 Deb, Jain (bib0080) 2014; 18 Ravikumar, Bajpai (bib0035) 1998; 21 Oliveira, Araújo (bib0220) 2004 Fabregat, Donoso, Baram, Solano, Marzo (bib0030) 2005 Lafetá, Bueno, Brasil, Oliveira (bib0110) 2016 Mohammadi, Monfared, Bashiri (bib0190) 2017; 52 Zaheeruddin, Lobiyal, Prasad (bib0225) 2016 Bader, Zitzler (bib0200) 2011; 19 Liu, Wu (bib0040) 2003 Zitzler, Laumanns, Thiele (bib0055) 2002 Singh, Isaacs (bib0165) 2011; 15 Wang (bib0045) 2001; 24 Aguirre, Tanaka (bib0175) 2010 Bueno, Oliveira (bib0060) 2014; 55 Goh, Tan (bib0130) 2009 P.J. Fleming, R.C. Purshouse, R.J. Lygoe, Proc. of EMO 2005, Guanajuato, Mexico, March 9–11, 2005., Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, Ch. Many-Objective Optimization: An Engineering Design Perspective, 14–32. Jie, Kamal (bib0250) 2014 Ishibuchi, Tsukamoto (bib0155) 2008 Bueno, Oliveira (bib0015) 2010 Coello, VanVeldhuizen (bib0125) 2002 Magaia, Horta, Neves, Pereira, Correia (bib0230) 2015; 30 Zhengying, Bingxin, Erdun (bib0020) 2001; 24 Schutze, Esquivel, Lara, Coello (bib0115) 2012; 16 Saxena, Duro, Tiwari, Deb, Zhang (bib0205) 2013; 17 Aguirre, Tanaka (bib0170) 2009 Delbem, de Carvalho, Bretas (bib0100) 2005; 20 Assunção, Colanzi, Vergilio, Pozo (bib0065) 2011 Deb, Pratap, Agarwal, Meyarivan (bib0050) 2002; 6 Oliveira, Vita (bib0010) 2009 Srinivas, Deb (bib0140) 1994; 2 Li, Yang, Liu (bib0090) 2014; 18 Li, Deb, Zhang, Kwong (bib0085) 2015; 19 Deb (bib0120) 2001 Yiping, Dunwei, Xiaoyan, Yong (bib0185) 2016; 50 Sato, Aguirre, Tanaka (bib0195) 2007 Liu, Gu, Zhang (bib0210) 2014; 18 Zhang, Li (bib0075) 2007; 11 Zitzler, Thiele (bib0145) 1998 Yin, Chang, Chao, Chu (bib0240) 2014; 40 Núñez, Ayala, Paciello, Barán (bib0255) 2015 Shaukat, Anwar (bib0235) 2016; 75 Ishibuchi, Akedo, Ohyanagi, Nojima (bib0070) 2011 Adra, Fleming (bib0150) 2011; 15 Sindhya, Miettinen, Deb (bib0180) 2013; 17 Tan, Lee (bib0135) 2005 Girgis, Mahmoud, Hanna (bib0245) 2016; 5 Kaur, Shukla (bib0215) 2013 Zitzler (10.1016/j.asoc.2017.09.017_bib0055) 2002 Girgis (10.1016/j.asoc.2017.09.017_bib0245) 2016; 5 Zhang (10.1016/j.asoc.2017.09.017_bib0075) 2007; 11 Shaukat (10.1016/j.asoc.2017.09.017_bib0235) 2016; 75 Schutze (10.1016/j.asoc.2017.09.017_bib0115) 2012; 16 Kaur (10.1016/j.asoc.2017.09.017_bib0215) 2013 Saxena (10.1016/j.asoc.2017.09.017_bib0205) 2013; 17 Brasil (10.1016/j.asoc.2017.09.017_bib0095) 2013; 34 Assunção (10.1016/j.asoc.2017.09.017_bib0065) 2011 Magaia (10.1016/j.asoc.2017.09.017_bib0230) 2015; 30 Ishibuchi (10.1016/j.asoc.2017.09.017_bib0155) 2008 Núñez (10.1016/j.asoc.2017.09.017_bib0255) 2015 Koyama (10.1016/j.asoc.2017.09.017_bib0005) 2004 Jie (10.1016/j.asoc.2017.09.017_bib0250) 2014 Sato (10.1016/j.asoc.2017.09.017_bib0195) 2007 Bader (10.1016/j.asoc.2017.09.017_bib0200) 2011; 19 Bueno (10.1016/j.asoc.2017.09.017_bib0015) 2010 Goh (10.1016/j.asoc.2017.09.017_bib0130) 2009 Oliveira (10.1016/j.asoc.2017.09.017_bib0220) 2004 Wang (10.1016/j.asoc.2017.09.017_bib0045) 2001; 24 Bueno (10.1016/j.asoc.2017.09.017_bib0060) 2014; 55 Li (10.1016/j.asoc.2017.09.017_bib0085) 2015; 19 Coello (10.1016/j.asoc.2017.09.017_bib0125) 2002 Ravikumar (10.1016/j.asoc.2017.09.017_bib0035) 1998; 21 Lafetá (10.1016/j.asoc.2017.09.017_bib0110) 2016 Zhengying (10.1016/j.asoc.2017.09.017_bib0020) 2001; 24 Fabregat (10.1016/j.asoc.2017.09.017_bib0030) 2005 Liu (10.1016/j.asoc.2017.09.017_bib0040) 2003 Delbem (10.1016/j.asoc.2017.09.017_bib0100) 2005; 20 Deb (10.1016/j.asoc.2017.09.017_bib0120) 2001 Yin (10.1016/j.asoc.2017.09.017_bib0240) 2014; 40 Sindhya (10.1016/j.asoc.2017.09.017_bib0180) 2013; 17 Liu (10.1016/j.asoc.2017.09.017_bib0210) 2014; 18 Zitzler (10.1016/j.asoc.2017.09.017_bib0145) 1998 10.1016/j.asoc.2017.09.017_bib0105 Deb (10.1016/j.asoc.2017.09.017_bib0080) 2014; 18 Tan (10.1016/j.asoc.2017.09.017_bib0135) 2005 Singh (10.1016/j.asoc.2017.09.017_bib0165) 2011; 15 Aguirre (10.1016/j.asoc.2017.09.017_bib0175) 2010 Hadka (10.1016/j.asoc.2017.09.017_bib0160) 2013; 21 Yiping (10.1016/j.asoc.2017.09.017_bib0185) 2016; 50 Deb (10.1016/j.asoc.2017.09.017_bib0050) 2002; 6 Aguirre (10.1016/j.asoc.2017.09.017_bib0170) 2009 Ishibuchi (10.1016/j.asoc.2017.09.017_bib0070) 2011 Oliveira (10.1016/j.asoc.2017.09.017_bib0010) 2009 Adra (10.1016/j.asoc.2017.09.017_bib0150) 2011; 15 Mohammadi (10.1016/j.asoc.2017.09.017_bib0190) 2017; 52 Crichigno (10.1016/j.asoc.2017.09.017_bib0025) 2004 Li (10.1016/j.asoc.2017.09.017_bib0090) 2014; 18 Srinivas (10.1016/j.asoc.2017.09.017_bib0140) 1994; 2 Zaheeruddin (10.1016/j.asoc.2017.09.017_bib0225) 2016 |
| References_xml | – volume: 15 start-page: 183 year: 2011 end-page: 195 ident: bib0150 article-title: Diversity management in evolutionary many-objective optimization publication-title: IEEE Trans. Evol. Comput. – start-page: 665 year: 2004 end-page: 669 ident: bib0220 article-title: Determining multicast routes with QoS and traffic engineering requirements based on genetic algorithm publication-title: Proc. Cyber. Int. Systems, vol. 1 – year: 2016 ident: bib0225 article-title: An elitist nondominated sorting genetic algorithm for QoS multicast routing in wireless networks – volume: 11 start-page: 712 year: 2007 end-page: 731 ident: bib0075 article-title: MOEA/D: a multiobjective evolutionary algorithm based on decomposition publication-title: IEEE Trans. Evol. Comput. – volume: 15 start-page: 539 year: 2011 end-page: 556 ident: bib0165 article-title: A Pareto corner search evolutionary algorithm and dimensionality reduction in many-objective optimization problems publication-title: IEEE Trans. Evol. Comput. – year: 2004 ident: bib0025 article-title: A multicast routing algorithm using multiobjective optimization publication-title: IEEE 11th International Conference on Telecommunications – start-page: 1 year: 2015 end-page: 12 ident: bib0255 article-title: Protection with quality of service in optical WDM networks using many-objective ant colony optimization publication-title: 2015 Latin American Computing Conference (CLEI) – volume: 5 start-page: 516 year: 2016 end-page: 523 ident: bib0245 article-title: Tree growth based ACO algorithm for solving the bandwidth-delay-constrained least-cost multicast routing problem publication-title: Int. J. Comput. Inf. Technol. – volume: 18 start-page: 348 year: 2014 end-page: 365 ident: bib0090 article-title: Shift-based density estimation for Pareto-based algorithms in many-objective optimization publication-title: IEEE Trans. Evol. Comput. – volume: 2 start-page: 221 year: 1994 end-page: 248 ident: bib0140 article-title: Multiobjective function optimization using non-dominated sorting genetic algorithms publication-title: Evol. Comput. J. – volume: 55 start-page: 435 year: 2014 end-page: 448 ident: bib0060 article-title: Four-objective formulations of multicast flows via evolutionary algorithms with quality demands publication-title: Telecommun. Syst. – volume: 50 start-page: 344 year: 2016 end-page: 355 ident: bib0185 article-title: Many-objective evolutionary optimization based on reference points publication-title: Appl. Soft Comput. – volume: 17 start-page: 495 year: 2013 end-page: 511 ident: bib0180 article-title: A hybrid framework for evolutionary multiobjective optimization publication-title: IEEE Trans. Evol. Comput. – volume: 40 start-page: 61 year: 2014 end-page: 72 ident: bib0240 article-title: Niched ant colony optimization with colony guides for QoS multicast routing publication-title: J. Netw. Comput. Appl. – year: 2005 ident: bib0135 article-title: Multiobjective evolutionary algorithms and applications publication-title: Evolutionary Computation Journal – start-page: 19 year: 2002 end-page: 26 ident: bib0055 article-title: SPEA2: improving the strength Pareto evolutionary algorithm for multiobjective optimization publication-title: Evolutionary Methods for Design, Optimisation and Control – volume: 52 start-page: 1239 year: 2017 end-page: 1252 ident: bib0190 article-title: An improved evolutionary algorithm for handling many-objective optimization problems publication-title: Appl. Soft Comput. – start-page: 2576 year: 2014 end-page: 2581 ident: bib0250 article-title: Multi-objective multicast routing optimization in cognitive radio networks publication-title: 2014 IEEE Wireless Communications and Networking Conference (WCNC) – year: 2016 ident: bib0110 article-title: Many-objective evolutionary algorithms for multicast routing with quality of service problem publication-title: V BRACIS, Recife, Brazil – volume: 21 start-page: 231 year: 2013 end-page: 259 ident: bib0160 article-title: BORG: an auto-adaptive many-objective evolutionary computing framework publication-title: Evol. Comput. – start-page: 1 year: 2010 end-page: 8 ident: bib0175 article-title: Pareto partial dominance MOEA in many-objective optimization publication-title: Congress on Computational Intelligence (CEC-2010) – volume: 75 start-page: 2275 year: 2016 end-page: 2301 ident: bib0235 article-title: A fast and scalable technique for constructing multicast routing trees with optimized quality of service using a firefly based genetic algorithm publication-title: Multimedia Tools Appl. – volume: 24 start-page: 55 year: 2001 end-page: 61 ident: bib0045 article-title: Solution to QoS multicast routing problem based on heuristic genetic algorithm publication-title: J. Comput. – start-page: 2424 year: 2008 end-page: 2431 ident: bib0155 article-title: Evolutionary many-objective optimization: a short review publication-title: Congress on Evolutionary Computation (CEC-2008) – volume: 20 start-page: 425 year: 2005 end-page: 436 ident: bib0100 article-title: Main chain representation for evolutionary algorithms applied to distribution system reconfiguration publication-title: IEEE Trans. Power Syst. – volume: 30 start-page: 104 year: 2015 end-page: 112 ident: bib0230 article-title: A multi-objective routing algorithm for wireless multimedia sensor networks publication-title: Appl. Soft Comput. – start-page: 73 year: 2005 end-page: 86 ident: bib0030 article-title: Multi-objective optimization scheme for multicast flows: a survey, a model and a MOEA solution publication-title: 3rd International IFIP/ACM Latin American Conference on Networking – start-page: 1 year: 2010 end-page: 8 ident: bib0015 article-title: Multicast flow routing: evaluation of heuristics and multiobjective evolutionary algorithms publication-title: Proc. of the CEC 2010 – start-page: 1465 year: 2011 end-page: 1472 ident: bib0070 article-title: Behavior of EMO algorithms on many-objective optimization problems with correlated objectives publication-title: Proc. CEC – volume: 16 start-page: 504 year: 2012 end-page: 522 ident: bib0115 article-title: Using the averaged Hausdorff distance as a performance measure in evolutionary multiobjective optimization publication-title: IEEE Trans. Evol. Comput. – year: 2011 ident: bib0065 article-title: Estabelecendo sequências de teste de integração de classes: Um estudo comparativo da aplicação de três algoritmos evolutivos multiobjetivos publication-title: Proc. W. Teste e Tol. Falhas – volume: 17 start-page: 77 year: 2013 end-page: 99 ident: bib0205 article-title: Objective reduction in many-objective optimization: linear and nonlinear algorithms publication-title: IEEE Trans. Evol. Comput. – volume: 19 start-page: 45 year: 2011 end-page: 76 ident: bib0200 article-title: HypE: an algorithm for fast hypervolume-based many-objective optimization publication-title: Evol. Comput. – volume: 24 start-page: 685 year: 2001 end-page: 692 ident: bib0020 article-title: Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm publication-title: Comput. Commun. – start-page: 407 year: 2009 end-page: 422 ident: bib0170 article-title: Many-objective optimization by space partitioning and adaptive epsilon-ranking on MNK-landscapes publication-title: 5th International Conference on Evolutionary Multi-Criterion Optimization (EMO 2009) – volume: 19 start-page: 694 year: 2015 end-page: 716 ident: bib0085 article-title: An evolutionary many-objective optimization algorithm based on dominance and decomposition publication-title: IEEE Trans. Evol. Comput. – year: 2003 ident: bib0040 article-title: The degree-constrained multicasting algorithm using ant algorithm publication-title: IEEE 10th International Conference on Telecommunications – volume: 34 start-page: 1719 year: 2013 end-page: 1734 ident: bib0095 article-title: Multiobjective evolutionary algorithm with many tables for purely ab initio protein structure prediction publication-title: J. Comput. Chem. – start-page: 5 year: 2007 end-page: 20 ident: bib0195 article-title: Controlling dominance area of solutions and its impact on the performance of MOEAS publication-title: Proceedings of the 4th International Conference on Evolutionary Multi-criterion Optimization, EMO’07 – start-page: 1 year: 2009 end-page: 9 ident: bib0010 article-title: A multi-objective evolutionary algorithm with publication-title: Proc. CEC ’2009 – year: 2009 ident: bib0130 article-title: Evolutionary multi-objective optimization in uncertain environments: Issues and algorithms publication-title: in: Springer-Verlag – start-page: 290 year: 2013 end-page: 296 ident: bib0215 article-title: A review on evolutionary multiobjective optimization for routing problem of computer networks publication-title: Confluence 2013: The Next Generation Information Technology Summit (4th International Conference) – start-page: 23 year: 2004 end-page: 28 ident: bib0005 article-title: A GA-based multi-purpose optimization algorithm for QoS routing publication-title: 18th International Conference on Advanced Information Networking and Applications (AINA 2004) – volume: 18 start-page: 450 year: 2014 end-page: 455 ident: bib0210 article-title: Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems publication-title: IEEE Trans. Evol. Comput. – year: 2001 ident: bib0120 article-title: Multi-objective Optimization Using Evolutionary Algorithms – volume: 21 start-page: 126 year: 1998 end-page: 132 ident: bib0035 article-title: Source-based delay-bounded multicasting in multimedia networks publication-title: Comput. Commun. – reference: P.J. Fleming, R.C. Purshouse, R.J. Lygoe, Proc. of EMO 2005, Guanajuato, Mexico, March 9–11, 2005., Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, Ch. Many-Objective Optimization: An Engineering Design Perspective, 14–32. – year: 2002 ident: bib0125 article-title: Evolutionary Algorithms for Solving Multi-objective Problems – volume: 6 start-page: 182 year: 2002 end-page: 197 ident: bib0050 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: Trans. Evol. Comput. – start-page: 292 year: 1998 end-page: 304 ident: bib0145 article-title: Multiobjective optimization using evolutionary algorithms - a comparative case study publication-title: in: Proc. PPSN ’1998, PPSN V – volume: 18 start-page: 577 year: 2014 end-page: 601 ident: bib0080 article-title: An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, part I: solving problems with box constraints publication-title: EEE Trans. Evol. Comput. – volume: 18 start-page: 577 issue: 4 year: 2014 ident: 10.1016/j.asoc.2017.09.017_bib0080 article-title: An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, part I: solving problems with box constraints publication-title: EEE Trans. Evol. Comput. doi: 10.1109/TEVC.2013.2281535 – volume: 21 start-page: 126 issue: 2 year: 1998 ident: 10.1016/j.asoc.2017.09.017_bib0035 article-title: Source-based delay-bounded multicasting in multimedia networks publication-title: Comput. Commun. doi: 10.1016/S0140-3664(97)00124-2 – start-page: 1465 year: 2011 ident: 10.1016/j.asoc.2017.09.017_bib0070 article-title: Behavior of EMO algorithms on many-objective optimization problems with correlated objectives – ident: 10.1016/j.asoc.2017.09.017_bib0105 doi: 10.1007/978-3-540-31880-4_2 – volume: 17 start-page: 495 issue: 4 year: 2013 ident: 10.1016/j.asoc.2017.09.017_bib0180 article-title: A hybrid framework for evolutionary multiobjective optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2012.2204403 – volume: 5 start-page: 516 issue: 6 year: 2016 ident: 10.1016/j.asoc.2017.09.017_bib0245 article-title: Tree growth based ACO algorithm for solving the bandwidth-delay-constrained least-cost multicast routing problem publication-title: Int. J. Comput. Inf. Technol. – volume: 20 start-page: 425 issue: 1 year: 2005 ident: 10.1016/j.asoc.2017.09.017_bib0100 article-title: Main chain representation for evolutionary algorithms applied to distribution system reconfiguration publication-title: IEEE Trans. Power Syst. doi: 10.1109/TPWRS.2004.840442 – start-page: 1 year: 2015 ident: 10.1016/j.asoc.2017.09.017_bib0255 article-title: Protection with quality of service in optical WDM networks using many-objective ant colony optimization – start-page: 1 year: 2010 ident: 10.1016/j.asoc.2017.09.017_bib0015 article-title: Multicast flow routing: evaluation of heuristics and multiobjective evolutionary algorithms – volume: 15 start-page: 183 issue: 2 year: 2011 ident: 10.1016/j.asoc.2017.09.017_bib0150 article-title: Diversity management in evolutionary many-objective optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2010.2058117 – start-page: 2576 year: 2014 ident: 10.1016/j.asoc.2017.09.017_bib0250 article-title: Multi-objective multicast routing optimization in cognitive radio networks – year: 2003 ident: 10.1016/j.asoc.2017.09.017_bib0040 article-title: The degree-constrained multicasting algorithm using ant algorithm – start-page: 23 year: 2004 ident: 10.1016/j.asoc.2017.09.017_bib0005 article-title: A GA-based multi-purpose optimization algorithm for QoS routing – start-page: 290 year: 2013 ident: 10.1016/j.asoc.2017.09.017_bib0215 article-title: A review on evolutionary multiobjective optimization for routing problem of computer networks – volume: 17 start-page: 77 issue: 1 year: 2013 ident: 10.1016/j.asoc.2017.09.017_bib0205 article-title: Objective reduction in many-objective optimization: linear and nonlinear algorithms publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2012.2185847 – volume: 19 start-page: 694 issue: 5 year: 2015 ident: 10.1016/j.asoc.2017.09.017_bib0085 article-title: An evolutionary many-objective optimization algorithm based on dominance and decomposition publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2014.2373386 – volume: 19 start-page: 45 issue: 1 year: 2011 ident: 10.1016/j.asoc.2017.09.017_bib0200 article-title: HypE: an algorithm for fast hypervolume-based many-objective optimization publication-title: Evol. Comput. doi: 10.1162/EVCO_a_00009 – start-page: 1 year: 2010 ident: 10.1016/j.asoc.2017.09.017_bib0175 article-title: Pareto partial dominance MOEA in many-objective optimization – volume: 21 start-page: 231 issue: 2 year: 2013 ident: 10.1016/j.asoc.2017.09.017_bib0160 article-title: BORG: an auto-adaptive many-objective evolutionary computing framework publication-title: Evol. Comput. doi: 10.1162/EVCO_a_00075 – start-page: 407 year: 2009 ident: 10.1016/j.asoc.2017.09.017_bib0170 article-title: Many-objective optimization by space partitioning and adaptive epsilon-ranking on MNK-landscapes – volume: 24 start-page: 685 issue: 7–8 year: 2001 ident: 10.1016/j.asoc.2017.09.017_bib0020 article-title: Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm publication-title: Comput. Commun. doi: 10.1016/S0140-3664(00)00273-5 – volume: 34 start-page: 1719 issue: 20 year: 2013 ident: 10.1016/j.asoc.2017.09.017_bib0095 article-title: Multiobjective evolutionary algorithm with many tables for purely ab initio protein structure prediction publication-title: J. Comput. Chem. doi: 10.1002/jcc.23315 – volume: 52 start-page: 1239 year: 2017 ident: 10.1016/j.asoc.2017.09.017_bib0190 article-title: An improved evolutionary algorithm for handling many-objective optimization problems publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2016.08.042 – volume: 18 start-page: 348 issue: 3 year: 2014 ident: 10.1016/j.asoc.2017.09.017_bib0090 article-title: Shift-based density estimation for Pareto-based algorithms in many-objective optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2013.2262178 – year: 2004 ident: 10.1016/j.asoc.2017.09.017_bib0025 article-title: A multicast routing algorithm using multiobjective optimization – volume: 40 start-page: 61 year: 2014 ident: 10.1016/j.asoc.2017.09.017_bib0240 article-title: Niched ant colony optimization with colony guides for QoS multicast routing publication-title: J. Netw. Comput. Appl. doi: 10.1016/j.jnca.2013.08.003 – start-page: 19 year: 2002 ident: 10.1016/j.asoc.2017.09.017_bib0055 article-title: SPEA2: improving the strength Pareto evolutionary algorithm for multiobjective optimization – year: 2016 ident: 10.1016/j.asoc.2017.09.017_bib0225 – volume: 30 start-page: 104 year: 2015 ident: 10.1016/j.asoc.2017.09.017_bib0230 article-title: A multi-objective routing algorithm for wireless multimedia sensor networks publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2015.01.052 – volume: 11 start-page: 712 issue: 6 year: 2007 ident: 10.1016/j.asoc.2017.09.017_bib0075 article-title: MOEA/D: a multiobjective evolutionary algorithm based on decomposition publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2007.892759 – volume: 16 start-page: 504 issue: 4 year: 2012 ident: 10.1016/j.asoc.2017.09.017_bib0115 article-title: Using the averaged Hausdorff distance as a performance measure in evolutionary multiobjective optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2011.2161872 – year: 2016 ident: 10.1016/j.asoc.2017.09.017_bib0110 article-title: Many-objective evolutionary algorithms for multicast routing with quality of service problem – volume: 75 start-page: 2275 issue: 4 year: 2016 ident: 10.1016/j.asoc.2017.09.017_bib0235 article-title: A fast and scalable technique for constructing multicast routing trees with optimized quality of service using a firefly based genetic algorithm publication-title: Multimedia Tools Appl. doi: 10.1007/s11042-014-2405-4 – year: 2002 ident: 10.1016/j.asoc.2017.09.017_bib0125 – year: 2005 ident: 10.1016/j.asoc.2017.09.017_bib0135 article-title: Multiobjective evolutionary algorithms and applications publication-title: Evolutionary Computation Journal – volume: 2 start-page: 221 issue: 3 year: 1994 ident: 10.1016/j.asoc.2017.09.017_bib0140 article-title: Multiobjective function optimization using non-dominated sorting genetic algorithms publication-title: Evol. Comput. J. doi: 10.1162/evco.1994.2.3.221 – start-page: 5 year: 2007 ident: 10.1016/j.asoc.2017.09.017_bib0195 article-title: Controlling dominance area of solutions and its impact on the performance of MOEAS – start-page: 73 year: 2005 ident: 10.1016/j.asoc.2017.09.017_bib0030 article-title: Multi-objective optimization scheme for multicast flows: a survey, a model and a MOEA solution – start-page: 1 year: 2009 ident: 10.1016/j.asoc.2017.09.017_bib0010 article-title: A multi-objective evolutionary algorithm with ϵ-dominance to calculate multicast routes with QoS requirements – volume: 24 start-page: 55 issue: 1 year: 2001 ident: 10.1016/j.asoc.2017.09.017_bib0045 article-title: Solution to QoS multicast routing problem based on heuristic genetic algorithm publication-title: J. Comput. – year: 2001 ident: 10.1016/j.asoc.2017.09.017_bib0120 – volume: 15 start-page: 539 issue: 4 year: 2011 ident: 10.1016/j.asoc.2017.09.017_bib0165 article-title: A Pareto corner search evolutionary algorithm and dimensionality reduction in many-objective optimization problems publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2010.2093579 – start-page: 665 year: 2004 ident: 10.1016/j.asoc.2017.09.017_bib0220 article-title: Determining multicast routes with QoS and traffic engineering requirements based on genetic algorithm – year: 2011 ident: 10.1016/j.asoc.2017.09.017_bib0065 article-title: Estabelecendo sequências de teste de integração de classes: Um estudo comparativo da aplicação de três algoritmos evolutivos multiobjetivos – volume: 18 start-page: 450 issue: 3 year: 2014 ident: 10.1016/j.asoc.2017.09.017_bib0210 article-title: Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2013.2281533 – start-page: 2424 year: 2008 ident: 10.1016/j.asoc.2017.09.017_bib0155 article-title: Evolutionary many-objective optimization: a short review – volume: 50 start-page: 344 year: 2016 ident: 10.1016/j.asoc.2017.09.017_bib0185 article-title: Many-objective evolutionary optimization based on reference points publication-title: Appl. Soft Comput. – year: 2009 ident: 10.1016/j.asoc.2017.09.017_bib0130 article-title: Evolutionary multi-objective optimization in uncertain environments: Issues and algorithms – start-page: 292 year: 1998 ident: 10.1016/j.asoc.2017.09.017_bib0145 article-title: Multiobjective optimization using evolutionary algorithms - a comparative case study – volume: 6 start-page: 182 issue: 2 year: 2002 ident: 10.1016/j.asoc.2017.09.017_bib0050 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: Trans. Evol. Comput. doi: 10.1109/4235.996017 – volume: 55 start-page: 435 issue: 3 year: 2014 ident: 10.1016/j.asoc.2017.09.017_bib0060 article-title: Four-objective formulations of multicast flows via evolutionary algorithms with quality demands publication-title: Telecommun. Syst. doi: 10.1007/s11235-013-9797-8 |
| SSID | ssj0016928 |
| Score | 2.308706 |
| Snippet | [Display omitted]
•MEANDS is proposed: Many-objective Evolutionary Algorithm based on Non-dominated Decomposed Sets.•MEANDS is tailored to deal with discrete... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 851 |
| SubjectTerms | Evolutionary algorithms Genetic algorithms Many-objective algorithms Metaheuristics Multi-objective optimization Multicast routing |
| Title | MEANDS: A Many-objective Evolutionary Algorithm based on Non-dominated Decomposed Sets applied to multicast routing |
| URI | https://dx.doi.org/10.1016/j.asoc.2017.09.017 |
| Volume | 62 |
| WOSCitedRecordID | wos000418333500057&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-9681 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: AIEXJ dateStart: 20010601 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1ba9swFBah3cNe1l1Zd0MPezMyvsSW1TdvzW4sWSEd5M3IttwmZFaJndCftp-3o4udNB1lG4yAExQrVnQ-nXN0dC4Ivc15AWtM-IRTvyBDFjOSVyIioOpWEa88Ff2oi03QySSZzdjZYPCzi4XZLGldJ9fX7Oq_khragNgqdPYvyN3_KDTAZyA6XIHscP0jwo9H6eR0aiLOx7DUicwXhqs5o419snKVS5cXcjVvL384SpKV6tRgImtSSuUco_TQU6H8zaX6biraxuFWYQVtVbshFrxpnZVct53065LZ2vsa4PDaZX17h87wWIlWH8_7xkFpzi9kbxRYC10KXIUQFbJxvrpn7s6pf2MM1iYhAuC6B-W3Jfy9uS6Z5HyE4Ttj9527a9Dwkz2Dxu1IG8OY4wSgZM2VwrQlNCAsNiVfOm5uebthx4lNZmslu6nvcktoGPvFwuWwHpSzH9WZb01I6V4y7qkahxqGT3VuNRD-hwGNGIiEw_TzaPalP8GKma7r24_bBmwZ38L9J_1eKdpRdM4fogd2h4JTg6xHaCDqx-ioq_6BrTB4ghoDtBOc4psww7swwz3MsIYZljW-ATO8hRlWMMMWZriVuIcZtjB7ir5_GJ2__0RsCQ9ShMNhS4YJ6PMVg7kQsFXwwhD280GQwyssBRWhiMOccQr7Bs78PKJ55Jd5PoxAcy0DSqvwGTqoZS2eI8wZKLfARsJIhUMLIH7pCZoIL9BpLMUx8rs5zAqb316VWVlmnSPjIlPznql5zzyWwdsxcvo-Vya7y513Rx1pMqufGr0zAyTd0e_FP_Z7ie5v18crdNCu1uI1ulds2nmzemMB9wvR_bN_ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=MEANDS%3A+A+Many-objective+Evolutionary+Algorithm+based+on+Non-dominated+Decomposed+Sets+applied+to+multicast+routing&rft.jtitle=Applied+soft+computing&rft.au=Lafet%C3%A1%2C+Thiago&rft.au=Bueno%2C+Marcos+L.P.&rft.au=Brasil%2C+Christiane&rft.au=Oliveira%2C+Gina+M.B.&rft.date=2018-01-01&rft.pub=Elsevier+B.V&rft.issn=1568-4946&rft.eissn=1872-9681&rft.volume=62&rft.spage=851&rft.epage=866&rft_id=info:doi/10.1016%2Fj.asoc.2017.09.017&rft.externalDocID=S1568494617305562 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1568-4946&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1568-4946&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1568-4946&client=summon |