SciELO - Scientific Electronic Library Online

 
vol.22 número1A Workflow Ontology to Support Knowledge Management in a Group’s Organizational StructureDepth-First Reasoning on Trees índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • No hay artículos similaresSimilares en SciELO

Compartir


Computación y Sistemas

versión impresa ISSN 1405-5546

Resumen

GRANILLO MARTINEZ, Erika; GONZALEZ VELAZQUEZ, Rogelio; BERNABE LORANCA, María Beatriz  y  MARTINEZ FLORES, José Luis. A Neighborhood Combining Approach in GRASP's Local Search for Quadratic Assignment Problem Solutions. Comp. y Sist. [online]. 2018, vol.22, n.1, pp.179-187. ISSN 1405-5546.  https://doi.org/10.13053/cys-22-1-2779.

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

Palabras llave : Meta-heuristics; NP-hard; neighborhood structure; combinatorial optimization; local search; GRASP; QAP.

        · texto en Inglés     · Inglés ( pdf )