An outerplanar graph is a graph that admits a planar embedding such that all vertices appear on the boundary of its outer face. Given a positive integer $n$ and a color set $C$ with $K>0$ colors, we consider the problem of enumerating all colored and rooted outerplanar graphs with at most $n$ vertices without repetition. We design an efficient algorithm that can generate all required graphs in constant time per each and in linear space.