Back to activities
GERAD seminar

A branch-and-cut algorithm for the time window assignment vehicle routing problem


Apr 5, 2017   10:45 AM — 12:00 PM

Kevin Dalmeijer Erasmus University Rotterdam, Netherlands

We presents a branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known. A novel set of valid inequalities, the precedence inequalities, is introduced and multiple separation heuristics are presented. In our numerical experiments the branch-and-cut algorithm is 3.8 times faster when separating precedence inequalities. Furthermore, in our experiments, the branch-and-cut algorithm is 193.9 times faster than the best known algorithm in the literature. Finally, using our algorithm, instances of the TWAVRP are solved which are larger than the small scale instances previously presented in the literature.

Free entrance.
Welcome to everyone!

Guy Desaulniers organizer


Room 4488
André-Aisenstadt Building
Université de Montréal Campus
2920, chemin de la Tour
Montréal QC H3T 1J4

Research Axis

Research application