Let G be a graph family defined on a common vertex set V and let d be a distance defined on every graph G ∈ G. A set S ⊂ V is said to be a simultaneous metric generator for G if for every G ∈ G and every pair of different vertices u, v ∈ V there exists s ∈ S such that d(s, u) = d(s, v). The simultaneous metric dimension of G is the smallest integer k such that there is a simultaneous metric generator for G of cardinality k. We study the simultaneous metric dimension of families composed by corona product graphs. Specifically, we focus on the case of two particular distances defined on every G ∈ G, namely, the geodesic distance d G and the distance d G,2 : V × V → N ∪ {0} defined as d G,2 (x, y) = min{d G (x, y), 2}.