Exploring Further Advantages in an Alternative Formulation for the Set Covering Problem

Algorithm 1

The ACO algorithm.

	Initialize
	while not stop condition do
	for each ant in the nest do
	generate a new solution
	apply local search to the new solution
	end for
	update pheromone trails
	end while
	return the best solution found