Dynamic vehicle routing with anticipation in disaster relief

Pickup and delivery problems (PDP), where locations may both receive and send goods, are an extension of the classical vehiclerouting problem. This paper considers the application of a routing and scheduling problem for forwarding agencies handling less-than-truckload freight in disasters. The approach evaluates the benefits of dynamic optimization anticipating varying travel times (i.e., the availability of connections in this case) as well as unknown orders (i.e., the integration of demand regions on short-notice) in the specific environment of emergencies. The objective is to avoid delays and increase equipment utilization. We model a multi-stage mixed integer problem which is able to operate under variable demand and transport conditions.