We propose an algorithm based of the Ant Colony Optimization (ACO) metaheuristic for solving the p-center problem of a non-directed graph.