Regresar

Aco con una estrategia de exploración en dos etapas para el problema de cubrimiento de conjuntos

Abstract:

Optimization based on Ant Colony two stages (TS-ac), it represents a way to improve exploration strategy meta-heuristic optimization based on Ant Colony (ACO). TS-ACO, it is based on the methodology of "divide and conquer" and its effectiveness has been proven in several discrete optimization problems. In this paper, three approaches to TS-ACO are presented and appropriate adjustments are made to test their effectiveness in solving the problem of Coverage Sets (SCP). These approaches use partial results (only sub solution (S-TS-ACO) or only pheromone trail (P-TS-ACO) or both (PS-TS-ACO)), obtained in the first phase, in order to guide exploration in the second phase of the search process. Experimental results show that the best solutions are achieved by the variant P-TS-ACO. Finally a comparative study of the two-stage strategy and the original ACO strategy was performed. The results show that the proposed P-TS-ACO, you get significantly better results than the original strategy, in the same execution time and under the same parameter values.