Treffer: A metaheuristic proposal using Java for the quadratic assignment problem.

The classic combinatorial optimization problems belonging to the NP-hard class is the quadratic assignment problem. The interest in solving the problem lies in its high computational complexity, as well as its applications in logistics, gate assignment in airports, among others. In this work, the Greedy Random Adaptive Search Procedure metaheuristic was implemented to find its solutions. The main contribution of this work is the adaptation of a neighborhood structure contained in k-exchanges in the post-processing phase. The tests were performed for 29 large-scale instances whose dimensions range from 64 to 254 taken from the QAPLIB. The approximate solutions were found through a metaheuristic that bases its search on neighborhoods and local search algorithms. Java was the programming language used for the implementation of metaheuristics; its execution allowed balancing the parameters to obtain competitive results with respect to the values known in literature. The results reported achieved the proposed objectives. [ABSTRACT FROM AUTHOR]

Copyright of International Journal of Combinatorial Optimization Problems & Informatics is the property of International Journal of Combinatorial Optimization Problems & Informatics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)