A parametric framework for cooperative parallel local search
ABSTRACT: In this paper we address the problem of parallelizing local search. We propose a general framework where different local search engines cooperate (through communication) in the quest for a solution. Several parameters allow the user to instantiate and customize the framework, like the degr...
- Autores:
-
Múnera Ramírez, Danny Alexandro
Abreu, Salvador
Díaz, Daniel
Codognet, Philippe
- Tipo de recurso:
- Part of book
- Fecha de publicación:
- 2014
- Institución:
- Universidad de Antioquia
- Repositorio:
- Repositorio UdeA
- Idioma:
- eng
- OAI Identifier:
- oai:bibliotecadigital.udea.edu.co:10495/34436
- Acceso en línea:
- https://hdl.handle.net/10495/34436
- Palabra clave:
- Espacio de búsqueda
Search Space
Búsqueda local
Local Search
Nodo explorador
Explorer Node
Método de búsqueda local
Local Search Method
Constraint Satisfaction Problem
Problema de satisfacción de restricciones
- Rights
- openAccess
- License
- http://creativecommons.org/licenses/by/2.5/co/
| Summary: | ABSTRACT: In this paper we address the problem of parallelizing local search. We propose a general framework where different local search engines cooperate (through communication) in the quest for a solution. Several parameters allow the user to instantiate and customize the framework, like the degree of intensification and diversification. We implemented a prototype in the X10 programming language based on the adaptive search method. We decided to use X10 in order to benefit from its ease of use and the architectural independence from parallel resources which it offers. Initial experiments prove the approach to be successful, as it outperforms previous systems as the number of processes increases. |
|---|