Abstract
In this work we deal with the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads (MPDPSL). This problem is a generalization of the one-to-one Pickup and Delivery Problem (PDP) where each load can be served by multiple stops by the same vehicle. In practice split deliveries is a viable option in many settings such as courier services of third party logistics operators. We propose a branch-and-cut algorithm which employs valid inequalities devised for special cases of the MPDPSL, such as the Dial-a-Ride Problem, PDP and Split Delivery Vehicle Routing Problem. According to our computational experiments with randomly generated test instances, we may claim that the proposed algorithm can be used for small sized instances.
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.
