An immune-inspired algorithm for the set cover problem

9Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper introduces a novel parallel immune-inspired algorithm based on recent developments in the understanding of the germinal centre reaction in the immune system. Artificial immune systems are relatively new randomised search heuristics and work on parallelising them is still in its infancy. We compare our algorithm with a parallel implementation of a simple multi-objective evolutionary algorithm on benchmark instances of the set cover problem taken from the OR-library. We show that our algorithm finds feasible solutions faster than the evolutionary algorithm using less parameters and communication effort.

Cite

CITATION STYLE

APA

Joshi, A., Rowe, J. E., & Zarges, C. (2014). An immune-inspired algorithm for the set cover problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8672, 243–251. https://doi.org/10.1007/978-3-319-10762-2_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free