A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
We introduce the Pickup and Delivery Problem with Shuttle routes (PDPS). We propose one arc based model and two path based model for the PDPS. We develop a branch-and-cut-and-price algorithm. The method is evaluated on generated and real-world instances with up to 193 requests. Instances with up to 87 requests are solved to optimality in less than one hour.
branch-and-cut-and-price pickup and delivery problem transfers column generation