A binary invasiveweed optimization algorithm for the set covering problem

Vista sencilla de ítem
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorLegüe, I.F.es_ES
dc.contributor.authorOlguín, E.es_ES
dc.date.accessioned6/22/2022 14:20
dc.date.accessioned2022-06-22T19:51:05Z
dc.date.available6/22/2022 14:20
dc.date.available2022-06-22T19:51:05Z
dc.date.issued2016
dc.description.abstractThe Set Covering Problem (SCP) is a classic problem of combinatorial analytic. This problem consists in to find solutions what cover the needs to lower cost. Those can be services to cities, load balancing in production lines or databanks selections. In this paper,we study the resolution of SCP, through InvasiveWeed Optimization (IWO), in its binary version; Binary InvasiveWeed Optimization (BIWO). IWO, it is to imitate to InvasiveWeed behavior (reproduction and selection natural), through mathematics formulations. Where the best weed has more chance of reproduction. © Springer International Publishing Switzerland 2016.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-33625-1_41es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-33625-1_41
dc.language.isoen_USes_ES
dc.publisherSpringer Verlages_ES
dc.publisher.countryDEes_ES
dc.relation.ispartofAdvances in Intelligent Systems and Computinges_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.sourceAdvances in Intelligent Systems and Computinges_ES
dc.subjectComputer Sciencees_ES
dc.subjectEngineeringes_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#2.02.04es_ES
dc.titleA binary invasiveweed optimization algorithm for the set covering problemes_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:
4. A binary invasiveweed optimization algorithm for the set covering problem.pdf
Tamaño:
137.94 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso