| Revue: | Computación y sistemas |
| Base de datos: | PERIÓDICA |
| Número de sistema: | 000423257 |
| ISSN: | 1405-5546 |
| Autores: | Granillo Martínez, Erika1 González Velázquez, Rogelio2 Bernabé Loranca, María Beatriz2 Martínez Flores, José Luis1 |
| Instituciones: | 1Universidad Popular Autónoma del Estado de Puebla, Departamento de Ingenierías y Tecnologias de la Información, Puebla. México 2Benemérita Universidad Autónoma de Puebla, Facultad de Ciencias de la Computación, Puebla. México |
| Año: | 2018 |
| Periodo: | Ene-Mar |
| Volumen: | 22 |
| Número: | 1 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Enfoque: | Aplicado, descriptivo |
| Resumen en inglés | In this paper we describe a study for the search of solutions of the combinatorial optimization problem Quadratic Assignment Problem (QAP) through the implementation of a Greedy Randomized Adaptive Procedure Search (GRASP) and have been compared with the best solutions known in the literature, obtaining robust results in terms of the value of the objective function and the execution time. Also a comparison with the ant algorithm is presented with the aim of comparing the meta-heuristic. The most important contribution of this paper is the use of the combination of different neighborhood structures in the GRASP improvement phase. The experiment was performed for a set of test instances available in QAPLIB. The QAP belongs to the Np-hard class whereby this approximation algorithm is implemented |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Procesamiento de datos, Metaheurísticas, Algoritmos, Estructura de vecindad, Optimización combinatoria, Búsqueda local |
| Keyword: | Data processing, Metaheuristics, Algorithms, Neighborhood structure, Combinatorial optimization, Local search |
| Texte intégral: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
