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

WB6 Véhicules électriques et gestion de la congestion / Electric VRP and traffic management

10 mai 2017 10h30 – 12h10

Salle: CPA du Québec

Présidée par Samuel Pelletier

4 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h30 - 10h55

    Vehicle routing problems considering traffic and congestion

    • Rabie Jaballah, Présentateur, Université Laval
    • Leandro C. Coelho, Université Laval
    • Jacques Renaud, Université Laval

    Advances in communications and real-time data acquisition is changing the way we solve many of today’s transport problems. In fact, lately much attention is devoted to traffic information and congestion. A lot of data are generated taking into account the underlying street network and dynamic traffic conditions. Traditional solutions for the VRP falls short when it comes to traffic and congestion. Incorporating new technologies into the classical VRP creates new challenges in different areas such as the way we process data, create benchmarks, conceive and develop heuristics. In this talk we exploit some of these opportunities and discuss future research opportunities.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h55 - 11h20

    Arc-based MILP reformulation of a traffic control bi-level program

    • Léonard Ryo Morin, Présentateur, UdeM
    • Emma Frejinger, Université de Montréal
    • Bernard Gendron, DIRO and CIRRELT, U. de Montréal

    In this talk, we focus on a traffic control application. It consists of a transportation network manager who wants to allocate resources to control traffic flow on arcs in a network. The network manager has to take into account that there are several classes of users including those who have objectives that are antagonistic to his own. We present a bi-level programming formulation of this problem where an arc-based logit model predicts the path choices. We then reformulate it as a mixed integer linear program with a sample average approximation of the logit model over the scenarios sampled from the distribution of the latter.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h20 - 11h45

    A Matheuristic Approach for Solving the Electric Vehicle Routing Problem with Time Windows and Different Charges

    • Merve Keskin, Présentateur, Sabanci University
    • Bülent Çatay, Sabanci University

    We model the Electric Vehicle Routing Problem with Time Windows by allowing partial recharges using three charger types with different powers and propose a matheuristic approach to solve it. Our matheuristic couples the Adaptive Large Neighborhood Search with a MIP solver which post-optimizes the station selection and charging decisions.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h45 - 12h10

    Some recent research on electric vehicle routing.

    • Samuel Pelletier, Présentateur, HEC Montréal
    • Gilbert Laporte, HEC Montréal
    • Ola Jabali, Politecnico di Milano

    We introduce a problem in which electric vehicles must deliver goods to a set of customers over multiple days. The charging schedule and infrastructure at the depot must be determined such as to allow them to complete their routes. We model a non-linear charging function and integrate battery health considerations.

Retour