Genetic Branch-and-Bound or exact genetic algorithm ? - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

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-01025572 , version 1 (18-07-2014)

Identifiants

  • HAL Id : hal-01025572 , version 1

Citer

Cédric Pessan, Jean-Louis Bouquard, Emmanuel Neron. Genetic Branch-and-Bound or exact genetic algorithm ?. Internationale Conference on Artificial Evolution, Oct 2007, Tours, France. ⟨hal-01025572⟩
13 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More