Pasar al contenido principal

PROGRAMACION RESTRINGIDA DE OPERACIONES EN TALLERES HIBRIDOS INTEGRADOS SOBRE UNIDADES EN SECUENCIA. INDUSTRIA DEL AUTOMOVIL (ASPECTOS ECONOMICOS, JURIDICOS Y SOCIALES)

DPI2010-16759

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2010
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Adaptive IDEA for robust multiobjective optimization. Application to the r-TSALBP-m/A

  • Chica Serrano, Manuel|||0000-0002-4717-1056
  • Bautista Valhondo, Joaquín|||0000-0002-2214-4991
  • Cordón García, Oscar
  • Damas Arroyo, Sergio
Robust optimization tries to find flexible solutions when solving problems with uncertain scenarios and vague information. In this paper we present a multiobjective evolutionary algorithm to solve robust multiobjective optimization problems. This algorithm is a novel adaptive method able to evolve separate populations of robust and non-robust solutions during the search. It is based on the infeasibility driven evolutionary algorithm (IDEA) and uses an additional objective to evaluate the robustness of the solutions. The original and adaptive IDEAs are applied to solve the r-TSALBP-m/A, an assembly line balancing model that considers a set of demand production plans and includes robustness functions for measuring the temporal overloads of the stations of the assembly line with respect to the plans. Our results show that the proposed adaptive IDEA gets more robust non-dominated solutions for the problem. Also, we show that, for the case of the r-TSALBP-m/A, we can obtain Pareto fronts with a higher convergence by using the adaptive version of the algorithm.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Adaptive IDEA for robust multiobjective optimization. Application to the r-TSALBP-m/A

  • Chica Serrano, Manuel
  • Bautista Valhondo, Joaquín
  • Cordón García, Oscar
  • Damas Arroyo, Sergio
Robust optimization tries to find flexible solutions when solving problems with uncertain scenarios and vague information. In this paper we present a multiobjective evolutionary algorithm to solve robust multiobjective optimization problems. This algorithm is a novel adaptive method able to evolve separate populations of robust and non-robust solutions during the search. It is based on the infeasibility driven evolutionary algorithm (IDEA) and uses an additional objective to evaluate the robustness of the solutions. The original and adaptive IDEAs are applied to solve the r-TSALBP-m/A, an assembly line balancing model that considers a set of demand production plans and includes robustness functions for measuring the temporal overloads of the stations of the assembly line with respect to the plans. Our results show that the proposed adaptive IDEA gets more robust non-dominated solutions for the problem. Also, we show that, for the case of the r-TSALBP-m/A, we can obtain Pareto fronts with a higher convergence by using the adaptive version of the algorithm., Postprint (published version)