The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio...
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...