This paper focuses on a modified Multi-Depot Unmanned Aerial Vehicle Routing Problem (MMDUAVRP). Comparing to classic multi-depot vehicle routing problem. our studied problem has no constraints to restrict the depot where the Unmanned Aerial Vehicle (UAV) departs and returns. This work aims to minimize the number of UAVs and total distance traveled by all UAVs. https://parisnaturalfoodes.shop/product-category/promasil-chocolate/