A Teaching-Learning Optimization Algorithm for the Weighted Set-Covering Problem

dc.contributor.author Crawford, Broderick
dc.contributor.author Soto, Ricardo
dc.contributor.author Palma, Wenceslao
dc.contributor.author Aballay, Felipe
dc.contributor.author Astorga, Gino
dc.contributor.author Lemus-Romani, Jose
dc.contributor.author Rubio, Jose-Miguel
dc.date.accessioned 2024-07-05T15:39:20Z
dc.date.available 2024-07-05T15:39:20Z
dc.date.issued 2020
dc.description Lemus-Romani, José/0000-0001-5379-0315; Misra, Sanjay/0000-0002-3556-9331; LEMUS-ROMANI, JOSE/0000-0001-5379-0315; Rubio, Jose-Miguel/0000-0003-0377-4397; Palma, Wenceslao/0000-0002-7232-0412 en_US
dc.description.abstract The need to make good use of resources has allowed metaheuristics to become a tool to achieve this goal. There are a number of complex problems to solve, among which is the Set-Covering Problem, which is a representation of a type of combinatorial optimization problem, which has been applied to several real industrial problems. We use a binary version of the optimization algorithm based on teaching and learning to solve the problem, incorporating various binarization schemes, in order to solve the binary problem. In this paper, several binarization techniques are implemented in the teaching/learning based optimization algorithm, which presents only the minimum parameters to be configured such as the population and number of iterations to be evaluated. The performance of metaheuristic was evaluated through 65 benchmark instances. The results obtained are promising compared to those found in the literature. en_US
dc.description.sponsorship CONICYTPFCHA/DOCTORADO BECAS NACIONAL/2019 [21191692]; [CONICYT/FONDECYT/REGULAR/1171243]; [CONICYT/FONDECYT/REGULAR/1190129] en_US
dc.description.sponsorship Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1171243, Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1190129. This work was funded by the CONICYTPFCHA/DOCTORADO BECAS NACIONAL/2019 - 21191692. en_US
dc.identifier.doi 10.17559/TV-20180501230511
dc.identifier.issn 1330-3651
dc.identifier.issn 1848-6339
dc.identifier.scopus 2-s2.0-85092637629
dc.identifier.uri https://doi.org/10.17559/TV-20180501230511
dc.identifier.uri https://hdl.handle.net/20.500.14411/3214
dc.language.iso en en_US
dc.publisher Univ Osijek, Tech Fac en_US
dc.relation.ispartof Tehnicki vjesnik - Technical Gazette
dc.rights info:eu-repo/semantics/openAccess en_US
dc.subject combinatorial optimization en_US
dc.subject metaheuristics en_US
dc.subject set-covering problem (SCP) en_US
dc.subject teaching-learning-based optimization algorithm (TLBO) en_US
dc.title A Teaching-Learning Optimization Algorithm for the Weighted Set-Covering Problem en_US
dc.type Article en_US
dspace.entity.type Publication
gdc.author.id Lemus-Romani, José/0000-0001-5379-0315
gdc.author.id Misra, Sanjay/0000-0002-3556-9331
gdc.author.id LEMUS-ROMANI, JOSE/0000-0001-5379-0315
gdc.author.id Rubio, Jose-Miguel/0000-0003-0377-4397
gdc.author.id Palma, Wenceslao/0000-0002-7232-0412
gdc.author.scopusid 23395875300
gdc.author.scopusid 24403038600
gdc.author.scopusid 6603419658
gdc.author.scopusid 56989997600
gdc.author.scopusid 57189029937
gdc.author.scopusid 57208862820
gdc.author.scopusid 24773930800
gdc.author.wosid Lemus-Romani, José/GPX-2075-2022
gdc.author.wosid Misra, Sanjay/K-2203-2014
gdc.author.wosid LEMUS-ROMANI, JOSE/AAX-8412-2021
gdc.author.wosid Rubio, José-Miguel/J-3682-2017
gdc.bip.impulseclass C5
gdc.bip.influenceclass C5
gdc.bip.popularityclass C5
gdc.coar.access open access
gdc.coar.type text::journal::journal article
gdc.collaboration.industrial false
gdc.description.department Atılım University en_US
gdc.description.departmenttemp [Crawford, Broderick; Soto, Ricardo; Palma, Wenceslao; Aballay, Felipe; Lemus-Romani, Jose] Pontificia Univ Catolica Valparaiso, Ave Brasil 2241, Valparaiso, Chile; [Astorga, Gino] Univ Valparaiso, Prat 856, Valparaiso, Chile; [Castro, Carlos] Univ Tecn Federico Santa Maria, Ave Espana 1680, Valparaiso, Chile; [Paredes, Fernando] Univ Diego Port, Escuela Ingn Ind, Manuel Rodriguez 415, Santiago, Chile; [Rubio, Jose-Miguel] Univ Bernardo OHiggins, Av Viel 1497, Santiago, Chile; [Misra, Sanjay] Covenant Univ, Dept Comp & Informat Sci, KM 10 Idiroko Rd, Ota, Nigeria; [Misra, Sanjay] Atilim Univ, TR-06836 Ankara, Turkey en_US
gdc.description.endpage 1684 en_US
gdc.description.issue 5 en_US
gdc.description.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı en_US
gdc.description.scopusquality Q3
gdc.description.startpage 1678 en_US
gdc.description.volume 27 en_US
gdc.description.wosquality Q3
gdc.identifier.openalex W3107183644
gdc.identifier.wos WOS:000581774100042
gdc.index.type WoS
gdc.index.type Scopus
gdc.oaire.accesstype GOLD
gdc.oaire.diamondjournal false
gdc.oaire.impulse 1.0
gdc.oaire.influence 2.7886837E-9
gdc.oaire.isgreen false
gdc.oaire.keywords teaching-learning-based optimization algorithm (TLBO)
gdc.oaire.keywords metaheuristics
gdc.oaire.keywords combinatorial optimization
gdc.oaire.keywords TA1-2040
gdc.oaire.keywords Engineering (General). Civil engineering (General)
gdc.oaire.keywords set-covering problem (SCP)
gdc.oaire.popularity 3.0546021E-9
gdc.oaire.publicfunded false
gdc.oaire.sciencefields 0211 other engineering and technologies
gdc.oaire.sciencefields 0202 electrical engineering, electronic engineering, information engineering
gdc.oaire.sciencefields 02 engineering and technology
gdc.openalex.collaboration International
gdc.openalex.fwci 1.09282909
gdc.openalex.normalizedpercentile 0.82
gdc.opencitations.count 2
gdc.plumx.mendeley 21
gdc.plumx.scopuscites 6
gdc.scopus.citedcount 6
gdc.wos.citedcount 4
relation.isOrgUnitOfPublication 50be38c5-40c4-4d5f-b8e6-463e9514c6dd
relation.isOrgUnitOfPublication.latestForDiscovery 50be38c5-40c4-4d5f-b8e6-463e9514c6dd

Files

Collections