CALENDRIER

juin 2019
L M M J V S D
          01 02
03 04 05 06 07 08 09
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30

Partager cet événement

Enregistrer cet événement

Séminaire : Learning variable neighborhood search for a job-scheduling problem

Date
Vendredi 21 juin 2019
Débute à 10:30

Prix
gratuit

Contact
Marilyne Lavoie
Site Web

Lieu
4488
2920, chemin de la Tour
Montréal, QC Canada
H3T 1N8

514 343-6111
Site Web | Itinéraire et carte

Catégories


Consulté 6308 fois
Séminaire :  Learning variable neighborhood search for a job-scheduling problem

Séminaire conjoint avec la Chaire en logistique et en transport et le GERAD

Titre : Learning variable neighborhood search for a job-scheduling problem

Conférencier : Nicolas Zufferey – Professeur titulaire, GSEM, Université de Genève, Suisse

Variable neighborhood search is a local search metaheuristic that uses sequentially different neighborhood structures. This method has been successfully applied to various types of problems. In this work, variable neighborhood search is enhanced with a learning mechanism which helps to drive the search toward promising areas of the search space. The resulting method is applied to a single-machine scheduling problem with rejections, setups, and earliness and tardiness penalties. Experiments are conducted for instances from the literature. They show on the one hand the benefit of the learning mechanism (in terms of solution quality and robustness). On the other hand, the proposed method significantly outperforms state-of-the-art algorithms for the considered problem. Moreover, its flexibility allows its straightforward adaptation to other combinatorial optimization problems.

---

Entrée gratuite.
Bienvenue à tous!

© École Polytechnique de Montréal
Bottin | Plan du site | Recherche | Conditions | Besoin d'aide?