Mostrar el registro sencillo del ítem

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorAballay F.
dc.contributor.authorMisra S.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:34Z
dc.date.available2020-09-02T22:15:34Z
dc.date.issued2015
dc.identifier10.1007/978-3-319-21410-833
dc.identifier.citation9158, , 421-430
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4113
dc.descriptionThe 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.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceGavrilova M.L.Gervasi O.Murgante B.Misra S.Torre C.Taniar D.Apduhan B.O.Rocha A.M.A.C.Misra S.
dc.subjectCombinatorial optimization
dc.subjectMetaheuristics
dc.subjectSet Covering Problem
dc.subjectTeaching-Learning-Based Optimization algorithm
dc.subjectAlgorithms
dc.subjectBenchmarking
dc.subjectCombinatorial optimization
dc.subjectFactory automation
dc.subjectLearning algorithms
dc.subjectProblem solving
dc.subjectTeaching
dc.subjectCombinatorial optimization problems
dc.subjectMeta heuristics
dc.subjectReal-world
dc.subjectSet covering problem
dc.subjectTeaching-learning-based optimizations
dc.subjectOptimization
dc.titleA teaching-learning-based optimization algorithm for solving set covering problems
dc.typeConference Paper


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem