This paper presents a multiobjective ant colony algorithm for the Multi-Depot Vehicle Routing Problem with Backhauls (MDVRPB) where three objectives of traveled distance, traveling times and total consumption of energy are minimized.An ant colony algorithm is proposed to solve the MDVRPB.The solution scheme allows one to find a set of ordered solutions in Pareto fronts by considering the concept of dominance.The effectiveness of the proposed approach is examined by considering a set of instances adapted from the literature.The computational results show high quality results within short computing times.