CALENDRIER

août 2017
L M M J V S D
  01 02 03 04 05 06
07 08 09 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30 31      

Partager cet événement

Enregistrer cet événement

Séminaire : A branch-and-cut algorithm for the time window assignment vehicle routing problem

Date
Mercredi 5 avril 2017
Débute à 10:45

Prix
gratuit

Contact
Marilyne Lavoie
Site Web

Lieu
4488
2920, chemin de la Tour
Montréal, QC Canada
H3T 1N8

514 343-6111
Site Web | Itinéraire et carte

Catégories


Consulté 1377 fois
Séminaire :  A branch-and-cut algorithm for the time window assignment vehicle routing problem

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

Conférencier : 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!

© École Polytechnique de Montréal
Bottin | Plan du site | Recherche | Conditions | Besoin d'aide?