This work introduces a modified MAX MIN ant system(MMAS) designed to solve the Multi-Depot Routingproblem (MDVRP). It presents the most relevant stepstowards the implementation of an MMAS to solve theMDVRP, involving servicing a set of customers from aset of specific capacitated depots using a set of identicalvehicles with limited capacity. The objective of theproblem is to minimize the total cost/distance of systemconsisting of multi depots and multi customers. SinceMDVRP is an NP-hard combinatorial problem, theheuristic is an appropriate approach to solve thisproblem.In this study, the proposed heuristic is based on MMASwith the MDVRP. In addition, the 2–opt heuristic isutilized to improve each vehicle tour. This approachaims to integrate two levels of decision making(Location-Routing) in a computationally efficientmanner. Simulations are performed using probleminstances available from Or-Library. The results showedthat the modified MMAS performs efficiently in solvingMDVRP.