Massively parallel tabu search for the Quadratic Assignment Problem

Massively parallel tabu search for the Quadratic Assignment Problem

0.00 Avg rating0 Votes
Article ID: iaor19932395
Country: Switzerland
Volume: 41
Issue: 1/4
Start Page Number: 327
End Page Number: 341
Publication Date: May 1993
Journal: Annals of Operations Research
Authors: ,
Keywords: computational analysis: parallel computers, programming: quadratic
Abstract:

A new heuristic algorithm to perform tabu search on the Quadratic Assignment Problem (QAP) is developed. A massively parallel implementation of the algorithm on the Connection Machine CM-2 is provided. The implementation uses n2 processors, where n is the size of the problem. The elements of the algorithm, called Par

Reviews

Required fields are marked *. Your email address will not be published.