Advanced algorithms for the Set Covering Problem

This repo contains 2 algorithms for solving the Set Covering Problem:

1. Ant Colony Optimization (Ren et al., 2010)
2. Genetic algorithm (Beasley and Chu, 1996)

This project is part of the course Heuristic Optimization given at both VUB and ULB.

by Jens Nevens

References

• Ren, Z. G., Feng, Z. R., Ke, L. J., & Zhang, Z. J. (2010). New ideas for applying ant colony optimization to the set covering problem. Computers & Industrial Engineering, 58(4), 774-784.
• Beasley, J. E., & Chu, P. C. (1996). A genetic algorithm for the set covering problem. European Journal of Operational Research, 94(2), 392-404.