The time window assignment vehicle routing problem with time dependent travel times

This talk is about assigning time windows to customers before their demand is learned and designing optimal vehicle routes adhering to these time windows after demand is learned. Demand is modeled using several demand scenarios. Travel times are modeled time dependently to account for congestion which occurs in every day practice. The goal is to assign the time windows such that the expected transportation costs are minimized. A branch-price-and-cut algorithm is developed to solve this problem.

Please note: Registration to the secretary's office of the econometric institute, eb-secr@ese.eur.nl, is required for availability of lunch.