Constrained neural approaches to quadratic assignment problems

Neural Networks

Volumn 11, Issue 6, 1998, Pages 1073-1082

  Ishii, S ^a,b   Sato, M ^b  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b ADVANCED TELECOMMUNICATIONS RESEARCH INSTITUTE INTERNATIONAL   (Japan)

Author keywords

Chaotic neural network; Combinatorial optimization; Hard constraints; Potts spin; Quadratic assignment problem

Indexed keywords

CHAOS THEORY; COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; HEURISTIC METHODS; QUADRATIC PROGRAMMING;

CHAOTIC NEURAL NETWORKS; CONSTRAINED NEURAL METHODS; POTTS SPIN; QUADRATIC ASSIGNMENT PROBLEMS;

NEURAL NETWORKS;

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; CHAOTIC DYNAMICS; MATHEMATICAL COMPUTING; PRIORITY JOURNAL;

EID: 0032144697     PISSN: 08936080     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-6080(98)00077-X     Document Type: Article

References (26)

1. Aihara K., Takabe T., Toyoda M. Chaotic neural networks. Physics Letters A. 144:1990;333-340.
2. Battiti R., Tecchiolli G. The reactive tabu search. ORSA Journal on Computing. 6:1994;126-140.
3. Bilbro, G., Mann, R., Miller, T.K., Snyder, W.E., Van den Bout, D.E., & White, M. (1989). Optimization by mean field annealing. In D.S. Touretzky (Ed.), Advances in neural information processing systems I, Denver, 1988 (pp. 91-98). San Mateo, CA: Morgan Kaufmann.
4. Burkard R.E., Rendl F. A thermodynamically motivated simulation procedure for combinatorial optimization problems. European Journal of Operational Research. 17:1984;169-174.
5. Burkard R.E., Karisch S.E., Rendl F. QAPLIB - A quadratic assignment problem library. European Journal of Operational Research. 55:1991;115-119.
6. Chen L., Aihara K. Chaotic simulated annealing by a neural network model with transient chaos. Neural Networks. 8:1995;915-930.
7. Fleurent, C., & Ferland, J.A. (1994). Genetic hybrids for the quadratic assignment problem. In P. Pardados & H. Wolkowics (Eds.), Quadratic assignment and related problems (Vol. 16, pp. 173-187). DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society.
8. Hasegawa, M., Ikeguchi, T., & Aihara, K. (1997). Technical Report of IEICE, NLP97(49), pp. 73-80.
9. Hinton G.E. Deterministic Boltzmann learning performs steepest descent in weight-space. Neural Computation. 1:1989;143-150.
10. Hopfield J.J., Tank D.W. 'Neural' computations of decisions in optimization problems. Biological Cybernetics. 52:1985;141-152.
11. Ishii, S., & Sato, M. (1996). Doubly constrained network for combinatorial optimization. ATR Technical Report, TR-H-193, Kyoto: ATR.
12. Ishii S., Sato M. Chaotic Potts spin model for combinatorial optimization problems. Neural Networks. 10:1997;941-963.
13. Koopmans T., Beckmann M. Assignment problems and the location of economic activities. Econometrica. 25:1957;53-76.
14. Lin S. Computer solutions of the traveling salesman problem. Bell Systems Technical Journal. 44:1965;2245-2269.
15. Peterson C., Anderson J.R. Neural networks and NP-complete optimization problems: a performance study on the graph bisection problem. Complex Systems. 2:1988;59-89.
16. Peterson C., Söderberg B. A new method for mapping optimization problems onto neural networks. International Journal of Neural Systems. 1:1989;3-22.
17. Sato M., Ishii S. Bifurcations in mean-field-theory annealing. Physical Review E. 53:1996;5153-5168.
18. Skorin-Kapov J. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing. 2:1990;33-45.
19. Taillard E. Robust tabu search for the quadratic assignment problem. Parallel Computing. 17:1991;443-455.
20. Tate D.M., Smith A.E. A genetic approach to the quadratic assignment problem. Computers Operation Research. 22:1995;73-83.
21. Tokuda, I. (1997). Technical Report of IEEJ, IP97(8), pp. 57-62.
22. Van den Bout D.E., Miller III T.K. Improving the performance of the Hopfield-Tank neural network through normalization and annealing. Biological Cybernetics. 62:1989;129-139.
23. Wasserstrom E. Numerical solutions by the continuation method. SIAM Reviews. 15:1973;89-119.
24. Wilhelm M.R., Ward T.L. Solving quadratic assignment problems by 'simulated annealing'. IIE Transactions. 19:1987;107-119.
25. Wilson G.W., Pawley G.S. On the stability of the traveling salesman problem algorithm of Hopfield and Tank. Biological Cybernetics. 58:1988;63-70.
26. Wu F.Y. The Potts model. Reviews of Modern Physics. 54:1982;235-268.