Quadratic Assignation Problem: A solution approach with parallel GRASP

  • Beatriz Bernábe Loranca Benemérita Universidad Autónoma de Puebla
  • Martín Estrada Analco Benemérita Universidad Autónoma de Puebla
  • Rogelio González Velázquez Benemérita Universidad Autónoma de Puebla
  • Abraham Sánchez López Benemérita Universidad Autónoma de Puebla
  • Jorge Cerezo Sánchez Benemérita Universidad Autónoma de Puebla
  • Mario Bustillo Díaz Benemérita Universidad Autónoma de Puebla
Keywords: GRASP, QAP, Parallel system

Abstract

The goal of this work is to establish and solve the Quadratic As-signation Problem (QAP) as a combinatory optimization problem by means of GRASP (Greedy Randomized Adaptive Search Procedure) as an approximation method to QAP.Applying GRASP to QAP produces good results to obtain solutions close to the optimum or even reach the optimum in several cases. The implementation of a sequential program was successfully made in C. The robustness of GRASP obeys to the inclusions of strategic procedures for each one of the three local search neighborhood structures employed as a second phase of GRASP. Finally a parallel system was built to reduce the time cost of the CPU.

Published
2018-01-09
How to Cite
Bernábe Loranca, B., Estrada Analco, M., González Velázquez, R., Sánchez López, A., Cerezo Sánchez, J., & Bustillo Díaz, M. (2018). Quadratic Assignation Problem: A solution approach with parallel GRASP. International Journal of Combinatorial Optimization Problems and Informatics, 8(3), 33-38. Retrieved from https://ijcopi.org/index.php/ojs/article/view/16
Section
Articles