Genetic branch-and-bound or exact genetic algorithm ? - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Lecture Notes in Computer Science Année : 2008

Genetic branch-and-bound or exact genetic algorithm ?

Résumé

Production resettings is a vital element of production flexibility and optimizing the setup tasks scheduling within a production channel is required to improve production rate. This paper deals with a NP-Hard production resetting optimization problem based on an industrial case. In this paper we present how to hybrid a Branch-and-Bound method for this problem with a genetic algorithm. The idea is to use the genetic algorithm to improve the upper bound and thus speeding up the Branch-and-Bound while the genetic algorithm uses the content of the Branch-and-Bound stack to reduce its search space. Both methods are running in parallel and are therefore collaborating together.
Fichier non déposé

Dates et versions

hal-01022182 , version 1 (10-07-2014)

Identifiants

  • HAL Id : hal-01022182 , version 1

Citer

Cédric Pessan, Jean-Louis Bouquard, Emmanuel Neron. Genetic branch-and-bound or exact genetic algorithm ?. Lecture Notes in Computer Science, 2008, 4926, pp.136-147. ⟨hal-01022182⟩
28 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More