4 présentations

• 
  10h45 - 11h10

  Parallel machine scheduling with periodic maintenance, job rejection and weighted sum of completion times

  • Hanane Krim, Université Polytechnique Hauts-de-France
  • Rachid Benmansour, INSEA
  • David Duvivier, Université Polytechnique Hauts-de-France
  • Jean-Yves Potvin, prés., Université de Montréal
  • Nicolas Zufferey, University of Geneva

  We consider a bi-objective scheduling problem on two parallel, non identical machines with a periodic preventive maintenance policy. The two objectives involve minimization of job rejection costs and weighted sum of completion times. Two metaheuristics based on tabu search are proposed to solve this problem. Computational results on test instances of different sizes are reported.
• 
  11h10 - 11h35

  Decision-aiding approach to embed persons with disability to public transport

  • Danijela Doric, prés., Université de Polytechnique Hauts-de-France (UPHF), LAMIH UMR CNRS 8201
  • Yan Cimon, Université Laval, Faculté des sciences de l’administration, CIRRELT,
  • Igor Crevits, Université de Polytechnique Hauts-de-France (UPHF), LAMIH UMR CNRS 8201
  • Saïd Hanafi, Université de Polytechnique Hauts-de-France (UPHF), LAMIH UMR CNRS 8201

  We focus on the decision-aiding approach to imbed of disabled persons to public transport, with the goal to provide full independence in their displacement. We propose to frame the transport chain depending on the information of the network in order to the meet needs and remove barriers for the disabled persons.
  Key-words:
  Decision aiding, transport, persons with disabilities
• 
  11h35 - 12h00

  Variable neighborhood search for the set union knapsack problem

  • Saïd Hanafi, prés., Université de Polytechnique Hauts-de-France (UPHF), LAMIH UMR CNRS 8201
  • Bernard Gendron, Université de Montréal, CIRRELT
  • Raca Todosijevic, LAMIH, Université de Valenciennes et du Hainaut- Cambrésis

  The set-union knapsack problem (SUKP) is a generalization of knapsack problem where an item corresponds to a set of elements. SUKP has various applications including information security systems. We propose a variable neighborhood search for the SUKP and the computational results on a set of benchmark instances show its efficiency.

  Mots-Clés: set-union knapsack problem, knapsack problem, variable neighborhood search, metaheuristic
• 
  12h00 - 12h25

  Efficient matheuristics for multicommodity capacitated network design

  • Bernard Gendron, prés., Université de Montréal, CIRRELT
  • Saïd Hanafi, Université de Polytechnique Hauts-de-France (UPHF), LAMIH UMR CNRS 8201
  • Raca Todosijevic, LAMIH, Université de Valenciennes et du Hainaut- Cambrésis

  We present matheuristics for the multicommodity capacitated fixed-charge network design problem (MCND). The matheuristics are based on combining iterative linear programming (ILP) methods and slope scaling (SS) heuristics. Each iteration alternates between solving a linear program obtained by adding pseudo-cuts and a restricted mixed-integer programming (MIP) model. The SS heuristic is used as a warm start to a state-of-the-art generic method that solves the restricted MIP model. The resulting ILP/SS matheuristics are compared against state-of-the-art heuristics for the MCND on a set of large-scale difficult instances.