Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/113694
DC FieldValueLanguage
dc.contributor.authorGonzález Landín, Begoñaen_US
dc.contributor.authorRossit, Daniel A.en_US
dc.contributor.authorMéndez Babey, Máximoen_US
dc.contributor.authorFrutos, Marianoen_US
dc.date.accessioned2022-02-09T08:37:05Z-
dc.date.available2022-02-09T08:37:05Z-
dc.date.issued2022en_US
dc.identifier.issn1547-1063en_US
dc.identifier.otherScopus-
dc.identifier.urihttp://hdl.handle.net/10553/113694-
dc.description.abstractOverlapping solutions occur when more than one solution in the space of decisions maps to the same solution in the space of objectives. This situation threatens the exploration capacity of Multi- Objective Evolutionary Algorithms (MOEAs), preventing them from having a good diversity in their population. The influence of overlapping solutions is intensified on multi-objective combinatorial problems with a low number of objectives. This paper presents a hybrid MOEA for handling overlapping solutions that combines the classic NSGA-II with a strategy based on Objective Space Division (OSD). Basically, in each generation of the algorithm, the objective space is divided into several regions using the nadir solution calculated from the current generation solutions. Furthermore, the solutions in each region are classified into non-dominated fronts using different optimization strategies in each of them. This significantly enhances the achieved diversity of the approximate front of non-dominated solutions. The proposed algorithm (called NSGA-II/OSD) is tested on a classic Operations Research problem: The Multi-Objective Knapsack Problem (0-1 MOKP) with two objectives. Classic NSGA-II, MOEA/D and Global WASF-GA are used to compare the performance of NSGA-II/OSD. In the case of MOEA/D two different versions are implemented, each of them with a different strategy for specifying the reference point. These MOEA/D reference point strategies are thoroughly studied and new insights are provided. This paper analyses in depth the impact of overlapping solutions on MOEAs, studying the number of overlapping solutions, the number of solution repairs, the hypervolume metric, the attainment surfaces and the approximation to the real Pareto front, for different sizes of 0-1 MOKPs with two objectives. The proposed method offers very good performance when compared to the classic NSGA-II, MOEA/D and Global WASF-GA algorithms, all of them well-known in the literature.en_US
dc.languageengen_US
dc.relation.ispartofMathematical Biosciences and Engineeringen_US
dc.sourceMathematical Biosciences and Engineering [ISSN 1547-1063], v. 19 (4), p. 3369-3401, (Enero 2022)en_US
dc.subject12 Matemáticasen_US
dc.subject.otherBi-Objective Knapsack Problemen_US
dc.subject.otherMulti-Objective Combinatorial Optimization Problemsen_US
dc.subject.otherMulti-Objective Evolutionary Algorithmsen_US
dc.subject.otherObjective Space Divisionen_US
dc.subject.otherOverlapping Solutionsen_US
dc.titleObjective space division-based hybrid evolutionary algorithm for handing overlapping solutions in combinatorial problemsen_US
dc.typeinfo:eu-repo/semantics/Articleen_US
dc.typeArticleen_US
dc.identifier.doi10.3934/mbe.2022156en_US
dc.identifier.scopus85123609260-
dc.contributor.orcidNO DATA-
dc.contributor.orcidNO DATA-
dc.contributor.orcidNO DATA-
dc.contributor.orcidNO DATA-
dc.contributor.authorscopusid55643744700-
dc.contributor.authorscopusid57204662073-
dc.contributor.authorscopusid23474473600-
dc.contributor.authorscopusid24482935700-
dc.identifier.eissn1551-0018-
dc.description.lastpage3401en_US
dc.identifier.issue4-
dc.description.firstpage3369en_US
dc.relation.volume19en_US
dc.investigacionIngeniería y Arquitecturaen_US
dc.type2Artículoen_US
dc.utils.revisionen_US
dc.date.coverdateEnero 2022en_US
dc.identifier.ulpgcen_US
dc.contributor.buulpgcBU-INFen_US
dc.description.sjr0,446
dc.description.jcr2,6
dc.description.sjrqQ2
dc.description.jcrqQ2
dc.description.scieSCIE
dc.description.miaricds10,7
item.grantfulltextopen-
item.fulltextCon texto completo-
crisitem.author.deptGIR SIANI: Computación Evolutiva y Aplicaciones-
crisitem.author.deptIU Sistemas Inteligentes y Aplicaciones Numéricas-
crisitem.author.deptDepartamento de Matemáticas-
crisitem.author.deptGIR SIANI: Computación Evolutiva y Aplicaciones-
crisitem.author.deptIU Sistemas Inteligentes y Aplicaciones Numéricas-
crisitem.author.deptDepartamento de Informática y Sistemas-
crisitem.author.orcid0000-0002-7915-0655-
crisitem.author.orcid0000-0002-7133-7108-
crisitem.author.parentorgIU Sistemas Inteligentes y Aplicaciones Numéricas-
crisitem.author.parentorgIU Sistemas Inteligentes y Aplicaciones Numéricas-
crisitem.author.fullNameGonzález Landín, Begoña-
crisitem.author.fullNameMéndez Babey, Máximo-
Appears in Collections:Artículos
Adobe PDF (5,6 MB)
Show simple item record

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.