Abstract
SYNOPTIC ABSTRACTIn the Vehicle Routing Problem with Time Windows, a set of customers requests service by vehicles initially located at a central depot. Each customer provides a period of time in which they must be served. The service may consist of repair work or loading/unloading of the vehicle. The objective is to find tours for the vehicles, such that each customer is served in its specified time window and the total distance traveled by the vehicles is as small as possible. In this paper, we present a new polynomial-time heuristic for a stylized version of the problem, and show it is asymptotically optimal when customer locations are independent and identically distributed in a given region. We also describe the implementation of the heuristic and present computational results.
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 callMore From: American Journal of Mathematical and Management Sciences
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.
