Abstract
Vehicle Routing Problems have been extensively analyzed to reduce transportation costs. More particularly, the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) imposes the period of time of customer availability and the request time of customer as two constraints, which precisely reflects the real world situations. Using minimization of the total distance as the main objective to be fulfilled, this paper proposes a general framework to deal with DVRPTW. Based on this framework, different local search heuristics are also designed to wisely adjust the convergence speed. Extensive experiments are conducted. And the results prove the effectiveness and the efficiency of our approach.
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.
