Vehicle Routing and Truck Driver Scheduling Problem (VRTDSP)

Given a fleet of capacity constrained vehicles and a set of customer locations which have to be visited within given time windows, the Vehicle Routing and Truck Driver Scheduling Problem (VRTDSP) is the problem of determining a set of minimal cost routes such that all customers are visited within their time window and that all routes can be performed without violating capacity constraints or applicable hours of service regulations. The instances for the VRTDSP provided here are generated by modifying the instances of Solomon for the Vehicle Routing Problem with Time Windows. The generation of the modified instances is described in:

A. Goel. Vehicle Routing and Scheduling with Drivers’ Working Hours. Transportation Science. 43:1, p.17-26, 2009. DOI 10.1287/trsc.1070.0226

All time values represent minutes. The driving time between two locations in the VRTDSP can be calculated by determining the Euclidean distance and truncating the fractional part. The distance travelled can be obtained by dividing the driving time by 12.


Single machine scheduling problem with family setups and resource constraints

In the single machine family scheduling problem each job to be scheduled belongs to a family and setups are required between jobs belonging to different families. As an additional constraint, each job requires a certain amount of resource that is supplied through upstream processes. Schedules must be generated in such a way that the total resource demand does not exceed the resource supply up to any point in time. The goal is to find a schedule minimising total tardiness with respect to the given due dates of the jobs.

O. Herr and A. Goel, Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (2016), European Journal of Operational Research, 248(123-135), 2016. DOI 10.1016/j.ejor.2015.07.001



A. Goel. Truck Driver Scheduling in the European Union. Transportation Science. 44:4, p.429-441, 2010. DOI 10.1287/trsc.1100.0330

Download: Erratum.pdf