In this paper, we provide a combinatorial interpretation of alternating Eulerian numbers by examining the number of length n permutations with k alternating descents and a class of labeled lattice paths on an \((n-1)\times k\) rectangular grid, consisting of \(n-1\) horizontal (East) steps and k vertical (North) steps, with at most one vertical step per vertical level.