Abstract
We develop a heuristic for the period vehicle routing problem that uses an integer program and the record-to-record travel algorithm. Our heuristic produces very high-quality results on standard benchmark instances. We extend our heuristic to handle real-world routing considerations that involve reassigning customers to new routes and balancing the workload among drivers across routes. We demonstrate how these new variants can be used by managers to generate effective routes in practice.
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: Transportation Research Part E: Logistics and Transportation Review
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.
