A teaching-learning-based optimization algorithm for solving set covering problems

Vista sencilla de ítem
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorAballay, F.es_ES
dc.contributor.authorMisra, S.es_ES
dc.contributor.authorJohnson, F.es_ES
dc.contributor.authorParedes, F.es_ES
dc.date.accessioned6/22/2022 14:20
dc.date.accessioned2022-06-22T19:51:07Z
dc.date.available6/22/2022 14:20
dc.date.available2022-06-22T19:51:07Z
dc.date.issued2015
dc.description.abstractThe Set Covering Problem (SCP) is a representation of a kind of combinatorial optimization problem which has been applied in several problems in the real world. In this work we used a binary version of Teaching-Learning-Based Optimization (TLBO) algorithm to solve SCP, works with two phases known: teacher and learner; emulating the behavior into a classroom. The proposed algorithm has been tested on 65 benchmark instances. The results show that it has the ability to produce solutions competitively. © Springer International Publishing Switzerland 2015.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-21410-833es_ES
dc.identifier.urihttps://link.springer.com/chapter/10.1007/978-3-319-21410-8_33es_PE
dc.identifier.urihttps://doi.org/10.17559/TV-20180501230511es_PE
dc.identifier.urihttps://doaj.org/article/bc1bfd1074a041cfb709d47ab06657d5es_PE
dc.identifier.urihttps://hrcak.srce.hr/244863es_PE
dc.language.isoen_USes_ES
dc.publisherSpringer Verlages_ES
dc.publisher.countryDEes_ES
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)es_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)es_ES
dc.subjectComputer Sciencees_ES
dc.subjectMathematicses_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#2.02.04es_ES
dc.titleA teaching-learning-based optimization algorithm for solving set covering problemses_ES
dc.typeinfo:eu-repo/semantics/conferenceObjectes_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
16. A teaching-learning-based optimization algorithm for solving set covering problems.pdf
Tamaño:
194.13 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso