A computational comparison of local search heuristics for solving quadratic assigment problems

Panos M. Pardalos, Kowta A. Murthy, Terry Paul Harrison

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

It is well known that, in general, exact algorithms for the Quadratic Assignment Problem (QAP) cannot solve problems of size N > 15. Therefore, it is necessary to use heuristic approaches for solving large-scale QAPs. In this paper, we consider a class of heuristic approaches based on local search criteria. In particular, we selected four algorithms; CRAFT, Simulated Annealing, TABU search and the Graph Partitioning (GP) approach and studied their relative performance in terms of the quality of solutions and CPU times. All of these algorithms performed roughly the same, based on the results of two sets of test problems Executed on an IBM ES/3090-600S computer.

Original languageEnglish (US)
Pages (from-to)172-187
Number of pages16
JournalInformatica (Netherlands)
Volume4
Issue number1-2
DOIs
StatePublished - Jan 1 1993

Fingerprint

Local Search
Heuristics
Quadratic Assignment Problem
Graph Partitioning
Tabu Search
Exact Algorithms
CPU Time
Simulated Annealing
Test Problems
Simulated annealing
Program processors
Necessary
Class

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Applied Mathematics

Cite this

@article{e59eb4eaeec848ff9b5474db1ad9e934,
title = "A computational comparison of local search heuristics for solving quadratic assigment problems",
abstract = "It is well known that, in general, exact algorithms for the Quadratic Assignment Problem (QAP) cannot solve problems of size N > 15. Therefore, it is necessary to use heuristic approaches for solving large-scale QAPs. In this paper, we consider a class of heuristic approaches based on local search criteria. In particular, we selected four algorithms; CRAFT, Simulated Annealing, TABU search and the Graph Partitioning (GP) approach and studied their relative performance in terms of the quality of solutions and CPU times. All of these algorithms performed roughly the same, based on the results of two sets of test problems Executed on an IBM ES/3090-600S computer.",
author = "Pardalos, {Panos M.} and Murthy, {Kowta A.} and Harrison, {Terry Paul}",
year = "1993",
month = "1",
day = "1",
doi = "10.3233/INF-1993-41-212",
language = "English (US)",
volume = "4",
pages = "172--187",
journal = "Informatica",
issn = "0868-4952",
publisher = "IOS Press",
number = "1-2",

}

A computational comparison of local search heuristics for solving quadratic assigment problems. / Pardalos, Panos M.; Murthy, Kowta A.; Harrison, Terry Paul.

In: Informatica (Netherlands), Vol. 4, No. 1-2, 01.01.1993, p. 172-187.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A computational comparison of local search heuristics for solving quadratic assigment problems

AU - Pardalos, Panos M.

AU - Murthy, Kowta A.

AU - Harrison, Terry Paul

PY - 1993/1/1

Y1 - 1993/1/1

N2 - It is well known that, in general, exact algorithms for the Quadratic Assignment Problem (QAP) cannot solve problems of size N > 15. Therefore, it is necessary to use heuristic approaches for solving large-scale QAPs. In this paper, we consider a class of heuristic approaches based on local search criteria. In particular, we selected four algorithms; CRAFT, Simulated Annealing, TABU search and the Graph Partitioning (GP) approach and studied their relative performance in terms of the quality of solutions and CPU times. All of these algorithms performed roughly the same, based on the results of two sets of test problems Executed on an IBM ES/3090-600S computer.

AB - It is well known that, in general, exact algorithms for the Quadratic Assignment Problem (QAP) cannot solve problems of size N > 15. Therefore, it is necessary to use heuristic approaches for solving large-scale QAPs. In this paper, we consider a class of heuristic approaches based on local search criteria. In particular, we selected four algorithms; CRAFT, Simulated Annealing, TABU search and the Graph Partitioning (GP) approach and studied their relative performance in terms of the quality of solutions and CPU times. All of these algorithms performed roughly the same, based on the results of two sets of test problems Executed on an IBM ES/3090-600S computer.

UR - http://www.scopus.com/inward/record.url?scp=84974762207&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84974762207&partnerID=8YFLogxK

U2 - 10.3233/INF-1993-41-212

DO - 10.3233/INF-1993-41-212

M3 - Article

VL - 4

SP - 172

EP - 187

JO - Informatica

JF - Informatica

SN - 0868-4952

IS - 1-2

ER -