Retour aux activités
Séminaire du GERAD

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

iCalendar

5 avr. 2017   10h45 — 12h00

Kevin Dalmeijer Erasmus University Rotterdam, Pays-Bas

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.


Entrée gratuite.
Bienvenue à tous!

Guy Desaulniers responsable

Lieu

Salle 4488
Pavillon André-Aisenstadt
Campus de l'Université de Montréal
2920, chemin de la Tour Montréal QC H3T 1J4 Canada

Axe de recherche

Application de recherche