Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures

Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery

This work proposes a Branch-cut-and-price (BCP) approach for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). We also deal with a particular case of the VRPSPD, known as the Vehicle Routing Problem with Mixed Pickup and Delivery. The BCP algorithm was tested in well-known benchmark instances involving up to 200 customers. Four instances were solved for the first time ...

A branch-price-and-cut for the vehicle routing problem with time windows and multiple deliverymen

We address a variant of the vehicle routing problem with time windows, which includes the decision of how many deliverymen should be assigned to each vehicle in addition to the usual routing and scheduling decisions. This variant is relevant in cases in which many requests should be delivered in busy urban areas on the same day, and the service times at customers are long in relation to vehicle...

Improved Branch-Cut-and-Price for Capacitated Vehicle Routing

Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems

This article presents techniques for constructing robust Branch-Cutand-Price algorithms on a number of Vehicle Routing Problem variants. The word “robust” stress the effort of controlling the worst-case complexity of the pricing subproblem, keeping it pseudo-polynomial. Besides summarizing older research on the topic, some promising new lines of investigation are also presented, specially the d...

Branch-and-Price-and-Cut for the Vehicle Routing and Truck Driver Scheduling Problem

Many governments worldwide have imposed hours of service regulations for truck drivers to ensure that break and rest periods are regularly taken. Transport companies have to take these into account and plan the routes and schedules of their truck drivers simultaneously. This problem is called vehicle routing and truck driver scheduling problem (VRTDSP). With their paper “An exact method for veh...