Optimizing concurrent configuration and planning: A proposition to reduce computation time - IMT Mines Albi-Carmaux Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Optimizing concurrent configuration and planning: A proposition to reduce computation time

Michel Aldanondo
Élise Vareilles
L. Zhang

Résumé

This communication deals with mass customization and the association of the product configuration task with the planning of its production process while trying to optimize cost and cycle time. In some previous works, we have proposed an optimization algorithm, called CFB-EA. This communication concerns a way to improve CFB-EA for large problems. Previous experiments have highlighted that CFB-EA is able to find quickly a good approximation of the Pareto Front. This led us to propose to decompose the optimization in two tasks. First, a ``rough'' approximation of the Pareto Front is quickly searched and proposed to the user. Then the user indicates the area of the Pareto Front that he is interested in. The problem is filtered and the solution space reduced. A second optimization is launched on the focused area. Our goal is to compare the classical single task optimization with the two tasks proposed approach.
Fichier principal
Vignette du fichier
Optimizing concurrent configuration and planning.pdf (1.27 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01599438 , version 1 (17-10-2017)

Identifiants

  • HAL Id : hal-01599438 , version 1

Citer

Paul Pitiot, Michel Aldanondo, Élise Vareilles, T. Coudert, L. Zhang. Optimizing concurrent configuration and planning: A proposition to reduce computation time. 2013 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM 2013), 2013, Bangkok, Thailand. p. 1367-1371. ⟨hal-01599438⟩
110 Consultations
75 Téléchargements

Partager

Gmail Facebook X LinkedIn More