Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP

Authors:
Mauricio G. C. Resende;Panos M. Pardalos;Yong Li
Affiliations:
AT&T Bell Labs, Murray Hill, NJ;Univ. of Florida, Gainesville;Pennsylvania State Univ., University Park
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1996

Citing 2
Cited 7

A More Portable Fortran Random Number Generator

ACM Transactions on Mathematical Software (TOMS)
Algorithm 608: Approximate Solution of the Quadratic Assignment Problem

ACM Transactions on Mathematical Software (TOMS)

Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP

ACM Transactions on Mathematical Software (TOMS)
Probability Distribution of Solution Time in GRASP: An Experimental Investigation

Journal of Heuristics
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization
Generating Hard Test Instances with Known Optimal Solution for the Rectilinear Quadratic Assignment Problem

Journal of Global Optimization
Extensive Testing of a Hybrid Genetic Algorithm for Solving Quadratic Assignment Problems

Computational Optimization and Applications
Locality-aware connection management and rank assignment for wide-area MPI

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the NP-complete quadratic assignment problem (QAP), n facilities are to be assigned to n sites at minimum cost. The contribution of assigning facility i to site k and facility j to site l to the total cost is fij dkl, where fij is the flow between facilities i and j, and dkl is the distance between sites k and l. Only very small (n≤20) instances of the QAP have been solved exactly, and heuristics are therefore used to produce approximate solutions. This article describes a set of Fortran subroutines to find approximate solutions to dense quadratic assignment problems, having at least one symmetric flow or distance matrix. A greedy, randomized, adaptive search procedure (GRASP) is used to produce the solutions. The design and implementation of the code are described in detail, and extensive computational experiments are reported, illustrating solution quality as a function of running time.