In this paper, we propose a forward-backward-forward splitting algorithm with alternated inertial step for finding a zero of the sum of two monotone operators in a real Hilbert space. Then, by making use of primal-dual techniques we derive the alternated inertial primal-dual splitting algorithm of forward-backward-forward type for solving structured monotone inclusion problems involving parallel sums and compositions of maximally monotone operators with linear continuous ones and convex minimization problems. Finally, we demonstrate numerically that our proposed algorithm performs better than the existing algorithms.