摘要：The paper addresses the Multi-Depot Vehicle Routing Problem (MDVRP) motivated by its practical relevance and considerable difficulty. Specifically, the work focuses on the assignment of customers to depots, one of the phases carried out to solve the MDVRP. Many authors have tackled this problem, and there are different heuristics to perform this task. This paper presents two new heuristics for this important phase of the MDVRP. Both heuristics are simple to implement and are fast in their execution. Furthermore, experimental results showed that the achieved solutions are comparable to those of some of the most important heuristics for this task.
