Cultural algorithms for the set covering problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

35 Scopus citations


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.

Original languageEnglish
Title of host publicationAdvances in Swarm Intelligence - 4th International Conference, ICSI 2013, Proceedings
PublisherSpringer Verlag
Number of pages8
EditionPART 2
ISBN (Print)9783642387142
StatePublished - 2013
Event4th International Conference on Advances in Swarm Intelligence, ICSI 2013 - Harbin, China
Duration: 12 Jun 201215 Jun 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume7929 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th International Conference on Advances in Swarm Intelligence, ICSI 2013


  • Cultural Algorithm
  • Genetic and Evolutionary Computation
  • Weighted Set Covering Problem


Dive into the research topics of 'Cultural algorithms for the set covering problem'. Together they form a unique fingerprint.

Cite this