4 présentations

• 
  15h30 - 15h55

  Dynamically routing UAVs in the aftermath of a severe tornado

  • Sean Grogan, prés., Polytechnique Montreal
  • Robert Pellerin, École Polytechnique de Montréal
  • Michel Gamache, Polytechnique Montréal

  This presentation shows a case for using UAVs to assess damage after a tornado. Previous work uses a fixed search area and dispatches UAVs to assess potential tornado damage. This presentation will form the problem to a DVRP so UAVs can re-deploy to uncover the extent of the damage.
  
  Keywords: Dynamic Routing, Disaster Response, Unmanned Aerial Vehicles
• 
  15h55 - 16h20

  A mixed integer formulation for the locomotive routing problem with maintenance constraints.

  • Pedro Miranda, prés., HEC Montreal
  • Jean-François Cordeau, HEC Montréal, GERAD, CIRRELT
  • Emma Frejinger, DIRO and CIRRELT

  In this talk we address the Locomotive Routing Problem (LRP), a large-scale optimization problem faced by railroad companies that aims to determine the optimal sequence of trains each locomotive is assigned to, while considering locomotives maintenance requirements over the planning horizon. A mixed integer formulation and computational results are presented.

  Keywords: Locomotive Routing Problem; Rail Transportation; Large-scale Optimization
• 
  16h20 - 16h45

  The heterogeneous multi-crew scheduling and routing problem in road restoration

  • Alfredo Daniel Moreno Arteaga, prés., Federal University of Sao Carlos
  • Douglas Alem, University of Edinburgh Business School
  • Michel Gendreau, Polytechnique Montréal
  • Pedro Munari, Federal University of Sao Carlos (UFSCar)

  The heterogeneous multi-crew scheduling and routing problem consists of finding the schedule and route of crews that perform the restoration of damaged nodes in a network affected by disasters. Formulations and valid inequalities are proposed for the problem. The formulations are able to obtain good-quality solutions to realistically sized instances.
  Keywords: road restoration; mathematical formulations; valid inequalities.
• 
  16h45 - 17h10

  Optimization of a collaborative distribution network in the retail industry

  • Yun He, IMT Atlantique, LS2N, Nantes, France
  • Mike Hewitt, Loyola University Chicago
  • Fabien Lehuédé, prés., IMT Atlantique, LS2N
  • Juliette Medina, CRC Services
  • Olivier Péton, IMT Atlantique, LS2N

  We consider a collaborative distribution application arising in the retail industry. An operational distribution problem is solved to determine how to transport orders from shippers to stores through a network of logistics hubs. This defines a complex integrated load plan design and vehicle routing problem. To solve it, a two steps approach integrates an extension of the Dynamic Discretization Discovery algorithm.