4 Presentations

• 
  10:30 AM - 10:55 AM

  Vehicle routing problems considering traffic and congestion

  • Rabie Jaballah, presenter, Université Laval
  • Leandro C. Coelho, Université Laval
  • Jacques Renaud, Université Laval, CIRRELT

  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.

• 
  10:55 AM - 11:20 AM

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

  • Léonard Ryo Morin, presenter, UdeM
  • Emma Frejinger, DIRO and CIRRELT
  • Bernard Gendron, Université de Montréal, CIRRELT

  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.

• 
  11:20 AM - 11:45 AM

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

  • Merve Keskin, presenter, 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.

• 
  11:45 AM - 12:10 PM

  Some recent research on electric vehicle routing.

  • Samuel Pelletier, presenter, 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.