Integrated Routing and Scheduling of Hazmat Trucks with Stops En-Route

by

Osman Alp
Bilkent University 

In this talk, we consider an integrated routing and scheduling problem
in hazardous materials transportation where accident rates, population
exposure, and link durations on the network vary with time-of-day.
Stopping at the nodes of the network is allowed. Objective is to select
a minimum risk path subject to a constraint on the total duration of the
trip. This problem is equivalent to the constrained shortest path
problem on time dependent networks where delays at nodes are permitted.
Efficient pseudo-polynomial dynamic programming algorithms are proposed.
The most complicated version adopts legal regulations for hazmat
transportation.