In this paper, we propose several relaxation algorithms for solving the tensor equation arising from the higher-order Markov chain and the multilinear PageRank. The semi-symmetrization technique on the original equation is also employed to modify the proposed algorithms. The convergence analysis is given for the proposed algorithms. It is shown that the new algorithms are more efficient than the existing ones by some numerical experiments when relaxation parameters are chosen suitably.