| Article ID: | iaor1993321 |
| Country: | United Kingdom |
| Volume: | 19 |
| Start Page Number: | 287 |
| End Page Number: | 295 |
| Publication Date: | Mar 1992 |
| Journal: | Computers and Operations Research |
| Authors: | Skorin-Kapov Jadranka, Chakrapani Jaishankar |
| Keywords: | heuristics, artificial intelligence, neural networks, optimization: simulated annealing |
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). Inefficiencies 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.