Cultural algorithms for the set covering problem
MetadataShow full item record
This 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.
Showing items related by title, author, creator and subject.
Conference PaperCrawford B.; Soto R.; Guzmán N.; Johnson F.; Paredes F. (Springer Verlag, 2015)
Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem (2020) Soto R.; Crawford B.; Galleguillos C.; Barraza J.; Lizama S.; Muñoz A.; Vilches J.; Misra S.; Paredes F. (Springer Verlag, 2015)
Conference PaperCrawford B.; Soto R.; Caballero H.; Olguín E.; Misra S. (Springer Verlag, 2016)