Mostrar el registro sencillo del ítem

Cultural algorithms for the set covering problem

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorMonfroy E.
dc.date.accessioned2020-09-02T22:15:41Z
dc.date.available2020-09-02T22:15:41Z
dc.date.issued2013
dc.identifier10.1007/978-3-642-38715-9-4
dc.identifier.citation7929 LNCS, PART 2, 27-34
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4152
dc.descriptionThis paper addresses the solution of weighted set covering problems using cultural algorithms. The weighted set covering problem is a reasonably well known NP-complete optimization problem with many real world applications. We use a cultural evolutionary architecture to maintain knowledge of diversity and fitness learned over each generation during the search process. The proposed approach is validated using benchmark instances, and its results are compared with respect to other approaches which have been previously adopted to solve the problem. Our results indicate that the approach is able to produce very competitive results in compare with other algorithms solving the portfolio of test problems taken from the ORLIB. © 2013 Springer-Verlag Berlin Heidelberg.
dc.language.isoen
dc.subjectCultural Algorithm
dc.subjectGenetic and Evolutionary Computation
dc.subjectWeighted Set Covering Problem
dc.subjectCultural Algorithm
dc.subjectEvolutionary architectures
dc.subjectNP Complete
dc.subjectOptimization problems
dc.subjectSearch process
dc.subjectSet covering problem
dc.subjectTest problem
dc.subjectWeighted set covering problems
dc.subjectAlgorithms
dc.subjectBenchmarking
dc.subjectFactory automation
dc.subjectProblem solving
dc.titleCultural algorithms for the set covering problem
dc.typeConference Paper


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-84884865523.pdf
Tamaño:
2.297Kb
Formato:
PDF
Ver/

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

Mostrar el registro sencillo del ítem