论文信息 - A connectionist approach to the quadratic assignment problem

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.

Jadranka Skorin-Kapov | Jaishankar Chakrapani | J. Skorin-Kapov | Jaishankar Chakrapani

[1] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..

[2] Emile H. L. Aarts,et al. Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[3] E. Aarts,et al. Boltzmann machines for travelling salesman problems , 1989 .

[4] Thomas E. Vollmann,et al. An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[5] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[6] Jadranka Skorin-Kapov,et al. Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[7] R. Burkard. Quadratic Assignment Problems , 1984 .

[8] Leon Steinberg,et al. The Backboard Wiring Problem: A Placement Algorithm , 1961 .