A connectionist approach to the quadratic assignment problem

Jaishankar Chakrapani; Jadranka Skorin-Kapov

doi:10.1016/0305-0548(92)90050-F

A connectionist approach to the quadratic assignment problem

Jaishankar Chakrapani
, Jadranka Skorin-Kapov

Dean's Office, College of Business

Stony Brook University

Stony Brook University

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

Abstract

The possibilities of applying a Boltzmann machine, and a related connectionist model in which the escape from local optima is performed in a deterministic way using tabu search, are tested for the quadratic assignment problem (QAP). Inefficiences with this approach led to an improved computational model for the QAP which is based on connectionist architecture. Computational results for problems of dimensions ranging from 5 up to 90 are given.

Original language	English
Pages (from-to)	287-295
Number of pages	9
Journal	Computers and Operations Research
Volume	19
Issue number	3-4
DOIs	https://doi.org/10.1016/0305-0548(92)90050-F
State	Published - 1992

Access to Document

10.1016/0305-0548(92)90050-F

Cite this

@article{55149ccc13f34d6e8112345581c0522e,

title = "A connectionist approach to the quadratic assignment problem",

abstract = "The possibilities of applying a Boltzmann machine, and a related connectionist model in which the escape from local optima is performed in a deterministic way using tabu search, are tested for the quadratic assignment problem (QAP). Inefficiences with this approach led to an improved computational model for the QAP which is based on connectionist architecture. Computational results for problems of dimensions ranging from 5 up to 90 are given.",

author = "Jaishankar Chakrapani and Jadranka Skorin-Kapov",

year = "1992",

doi = "10.1016/0305-0548(92)90050-F",

language = "English",

volume = "19",

pages = "287--295",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

number = "3-4",

}

TY - JOUR

T1 - A connectionist approach to the quadratic assignment problem

AU - Chakrapani, Jaishankar

AU - Skorin-Kapov, Jadranka

PY - 1992

Y1 - 1992

N2 - The possibilities of applying a Boltzmann machine, and a related connectionist model in which the escape from local optima is performed in a deterministic way using tabu search, are tested for the quadratic assignment problem (QAP). Inefficiences with this approach led to an improved computational model for the QAP which is based on connectionist architecture. Computational results for problems of dimensions ranging from 5 up to 90 are given.

AB - The possibilities of applying a Boltzmann machine, and a related connectionist model in which the escape from local optima is performed in a deterministic way using tabu search, are tested for the quadratic assignment problem (QAP). Inefficiences with this approach led to an improved computational model for the QAP which is based on connectionist architecture. Computational results for problems of dimensions ranging from 5 up to 90 are given.

UR - https://www.scopus.com/pages/publications/0026852208

U2 - 10.1016/0305-0548(92)90050-F

DO - 10.1016/0305-0548(92)90050-F

M3 - Article

SN - 0305-0548

VL - 19

SP - 287

EP - 295

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 3-4

ER -

A connectionist approach to the quadratic assignment problem

Abstract

Access to Document

Other files and links

Fingerprint

Cite this