In this paper we investigate a new method to solve the Unicost Set Covering Problem. This method is based on the Electromagnetism Metaheuristic principles. The algorithm first creates a group of solutions, then applies a fixed number of local search and movement iterations based on the solution fitness. This heuristic was tested on 80 datasets of the OR library and it is not only able to find the best known solutions in a shorter computing time, but sometimes improves the best known ones.

Keywords