4 présentations

• 
  10h30 - 10h55

  Railway Timetabling Adapted to Variable Demand in One Line Corridor

  • Eva Barrena Algara, prés., CIRRELT - HEC Montréal
  • David Canca Ortiz, Universidad de Sevilla
  • Leandro C. Coelho, Université Laval
  • Gilbert Laporte, HEC Montréal

  Determination of railway timetables is a problem that affects the network performance as well as the level of satisfaction amongst the users. In this work, we tackle the problem of designing non periodic railway timetabling with variable demand in one line corridor having both aspects jointly into consideration.

• 
  10h55 - 11h20

  The Departure Time and Speed Optimization Problem

  • Anna Franceschetti, prés., Eindhoven University of Technology
  • Dorothée Honhon, Eindhoven University of Technology
  • Tom Van Woensel, Eindhoven University of Technology
  • Tolga Bektas, University of Southampton
  • Gilbert Laporte, HEC Montréal

  Given a fixed sequence of nodes, the Departure Time and Speed Optimization problem (DSOP) consists of optimizing departure times and travel speeds as to minimize the total fuel and driver costs. We present an exact algorithm to solve the DSOP in presence of traffic congestion.

• 
  11h20 - 11h45

  A Dynamic Moldable Job Scheduling Based Parallel SAT Solver

  • Sajjad Asghar, prés., University of New Brunswick
  • Eric Aubanel, University of New Brunswick
  • David Bremner, University of New Brunswick

  Boolean Satisfiability (SAT) is amongst the most important problems in theoretical computer science. We present a parallel SAT solver called DMSAT. DMSAT can solve hard SAT problems that were not solvable by miniSat and other parallel SAT solvers in the past SAT race competitions.

• 
  11h45 - 12h10

  Modèle d'affectation des types d'avion avec scénarios de demande et réaffectation

  • David Ialongo, prés., GERAD - Polytechnique Montréal
  • Guy Desaulniers, GERAD - Polytechnique Montréal

  Nous intégrons des scénarios de demande au problème d'affectation des types d'avion aux vols (FAP) afin d'obtenir une solution permettant d'optimiser les décisions de réaffectation de flotte durant la période de réservation. Le problème est résolu par décomposition de Benders où chaque sous-problème correspond à un scénario.