Ponencia
A prototype of parallel hybrid algorithm
Autor/es | León Blanco, José Miguel
Framiñán Torres, José Manuel González Rodríguez, Pedro Luis Andrade Pineda, José Luis Ruiz Usano, Rafael |
Departamento | Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I |
Fecha de publicación | 2009 |
Fecha de depósito | 2020-12-10 |
Publicado en |
|
Resumen | Parallel algorithms have focused an increase interest due to advantages in computation time
and quality of solutions when applied to industrial engineering problems. In this
communication
, we present a prototype for a ... Parallel algorithms have focused an increase interest due to advantages in computation time and quality of solutions when applied to industrial engineering problems. In this communication , we present a prototype for a parallel hybrid algorithm combining an exact method like Branch and Bound (B&B) and a metaheuristic like Complete Local Search (CLM), Ghosh and Sierksma (2002), based in the sequential algorithm Bound Driven Search (BDS), Framinan and Pastor (2008). |
Cita | León Blanco, J.M., Framiñán Torres, J.M., González Rodríguez, P.L., Andrade Pineda, J.L. y Ruiz Usano, R. (2009). A prototype of parallel hybrid algorithm. En International Conference on Industrial Engineering and Industrial Management (1071-1074), Barcelona-Terrassa: ADINGOR (Asociación para el desarrollo de la ingeniería de organización). |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
1071-1074.pdf | 318.0Kb | [PDF] | Ver/ | |