Abstract
In this paper we address the multi-depot open vehicle routing problem (MDOVRP), a complex and difficult problem arising in several real-life applications. In the MDOVRP vehicles start from several depots and do not need to return to the depot at the end of their routes. We propose a hybrid adaptive large neighbourhood search algorithm to solve the MDOVRP coupled with improvement procedures yielding a hybrid metaheuristic. The performance of the proposed metaheuristic is assessed on various benchmark instances proposed for this problem and its special cases, containing up to 48 customers (single-depot version) and up to six depots and 288 customers. The computational results indicate that the proposed algorithm is very competitive compared with the state-of-the-art methods and improves 15 best-known solutions for multi-depot instances and one best-known solution for a single-depot instance. A detailed sensitivity analysis highlights which components of the metaheuristic contribute most to the solution quality.
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.
