Abstract
The vehicle routing problem has a half-a-century development history with many variants and algorithms. In this work, we tackle a real-world variant which has a heterogeneous fleet of vehicles and requires scheduling at limited-slotted depots with a time window constraint at a centralized garage. We first give problem formulations, introduce our approach to decompose this variant into subproblems and present our framework algorithm with experiments on real-world data sets. Experimental results show that our algorithm outperforms the heuristic method relaxed from dynamic programming and the multi-stage local search method. Our result is also far better than that of the experience-based greedy method. Significant savings with low resource consumption suggest practical use of our algorithm in real-world applications.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.