Abstract
The split delivery vehicle routing problem is a variant of the standard vehiclerouting problem where the single-visit assumption is waived and a customer mightbe served on more than one vehicle tour. In this article we report on a studywhere we have applied the standard local search-based metaheuristics usingadaptations of the most widely used inter-tour and intra-tour exchange operatorsfor solving the standard vehicle routing problem now allowing splitting andjoining of deliveries. As we will show we could find new best solutions for 51out of 57 benchmark instances, which have been defined for this problemclass.
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.
