This paper proposes a solution method to the problem of allocating an empty container fleet to a set of stocking yards in order to minimize empty container stock and repositioning costs under uncertainties in demand, supply, container damages and repairing times. We propose an approximate solution for the problem based on a hierarchical approach. We used random data from different probability functions to generate problem instances and evaluate robustness and performance. We find that the proposed model solves the single location inventory problem in a very short time while obtaining high robustness and each one can be solved independently. This approach allows liners to reduce the complexity of an aggregate stochastic problem by solving multiple independent stochastic inventory problems. Additionally to other similar works, the presented models consider random container damages and repairing times.