A double Roman dominating function on a graph is a function with the properties that if , then vertex u is adjacent to at least one vertex assigned 3 or at least two vertices assigned 2, and if , then vertex u is adjacent to at least one vertex assigned 2 or 3. The weight of f equals . The double Roman domination number of a graph G is the minimum weight of a double Roman dominating function of G. A graph is said to be double Roman if , where is the domination number of G. We obtain the sharp lower bound of the double Roman domination number of generalized Petersen graphs , and we construct solutions providing the upper bounds, which gives exact values of the double Roman domination number for all generalized Petersen graphs . This implies that is a double Roman graph if and only if either (mod 3) or .