A new family of route formulations for split delivery vehicle routing problems

We propose a new family of formulations with route-based variables for the split delivery vehicle routing problem with and without time windows. Each formulation in this family is characterized by the maximum number of different quantities of demand that can be delivered to a customer during a vehicle visit. The larger that this number is, … Read more

Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs

Two critical yet frequently conflicting objectives for logistics and transportation service companies are improving customer satisfaction and reducing transportation cost. In particular, given a net- work of customer requests with preferred service times, it is very challenging to find vehicle routes and service schedules simultaneously that respect all operating constraints and minimize the total transportation … Read more