Parallel Ant System for the Set Covering Problem

@inproceedings{Rahoual2002ParallelAS,
  title={Parallel Ant System for the Set Covering Problem},
  author={Malek Rahoual and Riad Hadji and Vincent Bachelet},
  booktitle={Ant Algorithms},
  year={2002}
}
The Set Covering Problem (SCP) represents an important class of NP-hard combinatorial optimization problems. Actually, the exact algorithms, such as branch and bound, don’t find optimal solutions within a reasonable amount of time, except for small problems. Recently, the Ant systems (AS) were proposed for solving several combinatorial optimization problems… CONTINUE READING