In this research report, we propose a heuristic algorithm with some primal recovery strategies for capacitated facility location problems (CFLP), which is a well-known combinatorial optimization problem with applications in distribution, transportation and production planning. Many algorithms employ the branch-and-bound technique in order to solve the CFLP. There are also some different approaches which can recover primal solutions while exploiting the primal and dual structure simultaneously. One of them is a MVCD (Mean Value Cross Decomposition) ensuring convergence without solving a master problem. The MVCD was designed to handle LP-problems, but it was applied in mixed integer problems. However the MVCD has been applied to only uncapacitated facility location problems (UFLP), because it was very difficult to obtain "Integrality" property of Lagrangian dual subproblems sustaining the feasibility to primal problems. We present some heuristic strategies to recover primal feasible integer solutions, handling the accumulated primal solutions of the dual subproblem, which are used as input to the primal subproblem in the mean value cross decomposition technique, without requiring solutions to a master problem. Computational results for a set of various problem instances are reported.