3 présentations

• 
  15h30 - 15h55

  A Constraint Programming-Based Large Neighborhood Search for the Vehicle Routing Problem with Synchronization Constraints

  • Hossein Hojabri, prés., Université de Montréal
  • Michel Gendreau, Polytechnique Montréal
  • Jean-Yves Potvin, Université de Montréal
  • Louis-Martin Rousseau, Polytechnique Montréal

  A synchronized VRP happens when vehicles of different types are required at some customer location to perform a service. A constraint programming-based adaptive large neighborhood search is proposed to solve this type of problem, where the latter explores large neighborhoods while the former evaluates every single move.

• 
  15h55 - 16h20

  Column Generation Heuristic for the Time-Dependent Vehicle Routing Problem with Time Windows

  • Vincent Huart, prés., ISIMA
  • Sylvain Perron, GERAD, HEC Montréal
  • Christophe Duhamel, ISIMA

  We present a heuristic solution method for the Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW). The method is based on column generation and on Variable Neighborhood Descend (VND). We validate our algorithm on Solomon instances adapted to the case of time-dependency.

• 
  16h20 - 16h45

  The Multi-zone Multi-trip Pickup and Delivery Problem with Time Windows and Synchronization

  • Phuong Nguyen Khanh, prés., Université de Montréal
  • Teodor Gabriel Crainic, Université du Québec à Montréal
  • Michel Toulouse, Oklahoma State University

  Multi-zone Multi-trip Pickup and Delivery Problem with Time Windows and Synchronization (MZT-PDTWS) is an extension of the Multi-zone Multi-trip Vehicle Routing Problem with Time Windows by addressing the integration of outbound traffic into a single city logistic system. We propose a meta-heuristic to solve the problem.