Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
