Journées de l'optimisation 2017

HEC Montréal, 8-10 mai 2017

1er Atelier Canadien sur l'optimisation des soins de santé (CHOW)

HEC Montréal, 10-11 mai 2017

JOPT2017

HEC Montréal, 8 — 11 mai 2017

Horaire Auteurs Mon horaire
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

MB3 Méthodes exactes pour les problèmes de transport / Exact methods for routing problems

8 mai 2017 10h30 – 12h10

Salle: Marie-Husny

Présidée par Rafael Martinelli

4 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h30 - 10h55

    A comparison of formulations for the three-level lot sizing and transportation problem

    • Matthieu Gruson, Présentateur, HEC Montréal/CIRRELT
    • Jean-François Cordeau, HEC Montréal
    • Raf Jans, HEC Montréal

    In this talk we will present several MIP formulations to solve the three-level lot sizing and transportation problem. The formulations are either adapted from the two-level lot sizing literature or new. The results of extensive computational experiments will be given to compare the performance of each formulation.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h55 - 11h20

    A Branch-and-cut algorithm for the routing and refueling station location problem

    • Okan Arslan, Présentateur, HEC Montreal
    • Oya Karasan, Bilkent University
    • A.Ridha Mahjoub, Université Paris Dauphine
    • Hande Yaman, Bilkent University

    We introduce a novel model for the routing and refueling station location problem for alternative fuel vehicles and develop a branch-and-cut algorithm as an exact solution methodology. Computational experiments show that the algorithm improves solution times by orders of magnitude with respect to previously developed models and methods.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h20 - 11h45

    Exact methods for the Time Window Assignment Vehicle Routing Problem

    • Kevin Dalmeijer, Présentateur, Erasmus University Rotterdam
    • Guy Desaulniers, GERAD and Polytechnique Montreal

    We consider the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known. We consider both branch-and-cut and branch-price-and-cut algorithms to solve this problem to optimality. The algorithms are compared on their performance on a set of test-instances.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h45 - 12h10

    Exact and Heuristic Algorithms for an Industrial and Tramp Ship Routing and Scheduling Problem

    • Gabriel Homsi, Pontifícia Universidade Católica do Rio de Janeiro (PUC-Rio)
    • Rafael Martinelli, Présentateur, Pontifícia Universidade Católica do Rio de Janeiro (PUC-Rio)
    • Thibaut Vidal, Pontifícia Universidade Católica do Rio de Janeiro (PUC-Rio)

    We tackle a ship routing problem which extends the Pickup and Delivery Problem with Time Windows with heterogeneous fleet, compatibility constraints and different ship starting points. We propose a Hybrid Genetic Search with Advanced Diversity Control and a column generation algorithm. Our experiments show the good performance of the methods.

Retour