Abstract
A vehicle routing problem for servicing objects with the possibility of distributing work between vehicle taking into account time windows is considered. We discuss approaches to constructing integer linear programming models and their modifications. A large neighborhood search algorithm is proposed to find approximate solutions. Here an improving solution is constructed using the “destroy” and “repair” methods at each step. A series of instances with various structures are proposed, in particular demonstrating the reason of returns to objects for vehicles. The results of an experimental evaluation of models and algorithms are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: The Bulletin of Irkutsk State University. Series Mathematics
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.