Abstract Our interest lies in developing some efficient methods for minimizing the sum of two geodesically convex functions on Hadamard manifolds, with the aim of improving the convergence of the Douglas-Rachford algorithm in Hadamard manifolds. Specifically, we propose two types of algorithms: inertial and non-inertial algorithms. The convergence analysis of both algorithms is provided under suitable assumptions on algorithmic parameters and the geodesic convexity of the objective functions. This convergence analysis is based on fixed-point theory for nonexpansive operators. We also study the convergence rates of these two methods. Additionally, we introduce parallel Douglas-Rachford type algorithms for minimizing functionals containing multiple summands with applications to the generalized Heron problem on Hadamard manifolds. To demonstrate the effectiveness of the proposed algorithms, we present some numerical experiments for the generalized Heron problems. Keywords. Inertial methods, Douglas-Rachford methods, Fixed point methods, Minimization problems, Generalized Heron problems