Neural algorithms for placement problems

Kiichi Urahama, Hiroshi Nishiyuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Two improved neural algorithms are presented for solving a placement problem which is a familiar class of NP-hard quadratic assignment problems. Formulation of the problem as a zero-one integer programming leads to an improved form of the Hopfield networks, while a mixed integer programming formulation results in an analogue algorithm similar to the elastic nets. The outermost loop in these algorithms performs an automatically scheduled deterministic annealing. This gives us a natural interpretation of the annealing procedure derived straightforwardly from the mathematical programming framework. Experiments reveal that the adaptive elastic net algorithm outperforms the adaptive Hopfield method.

Original languageEnglish
Title of host publicationProceedings of the International Joint Conference on Neural Networks
PublisherPubl by IEEE
Pages2421-2424
Number of pages4
Volume3
ISBN (Print)0780314212, 9780780314214
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of 1993 International Joint Conference on Neural Networks. Part 1 (of 3) - Nagoya, Jpn
Duration: Oct 25 1993Oct 29 1993

Other

OtherProceedings of 1993 International Joint Conference on Neural Networks. Part 1 (of 3)
CityNagoya, Jpn
Period10/25/9310/29/93

Fingerprint

Integer programming
Annealing
Mathematical programming
Experiments

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Urahama, K., & Nishiyuki, H. (1993). Neural algorithms for placement problems. In Proceedings of the International Joint Conference on Neural Networks (Vol. 3, pp. 2421-2424). Publ by IEEE.

Neural algorithms for placement problems. / Urahama, Kiichi; Nishiyuki, Hiroshi.

Proceedings of the International Joint Conference on Neural Networks. Vol. 3 Publ by IEEE, 1993. p. 2421-2424.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Urahama, K & Nishiyuki, H 1993, Neural algorithms for placement problems. in Proceedings of the International Joint Conference on Neural Networks. vol. 3, Publ by IEEE, pp. 2421-2424, Proceedings of 1993 International Joint Conference on Neural Networks. Part 1 (of 3), Nagoya, Jpn, 10/25/93.
Urahama K, Nishiyuki H. Neural algorithms for placement problems. In Proceedings of the International Joint Conference on Neural Networks. Vol. 3. Publ by IEEE. 1993. p. 2421-2424
Urahama, Kiichi ; Nishiyuki, Hiroshi. / Neural algorithms for placement problems. Proceedings of the International Joint Conference on Neural Networks. Vol. 3 Publ by IEEE, 1993. pp. 2421-2424
@inproceedings{0890ea6befcb48f58e9f6aaba0b1f67e,
title = "Neural algorithms for placement problems",
abstract = "Two improved neural algorithms are presented for solving a placement problem which is a familiar class of NP-hard quadratic assignment problems. Formulation of the problem as a zero-one integer programming leads to an improved form of the Hopfield networks, while a mixed integer programming formulation results in an analogue algorithm similar to the elastic nets. The outermost loop in these algorithms performs an automatically scheduled deterministic annealing. This gives us a natural interpretation of the annealing procedure derived straightforwardly from the mathematical programming framework. Experiments reveal that the adaptive elastic net algorithm outperforms the adaptive Hopfield method.",
author = "Kiichi Urahama and Hiroshi Nishiyuki",
year = "1993",
language = "English",
isbn = "0780314212",
volume = "3",
pages = "2421--2424",
booktitle = "Proceedings of the International Joint Conference on Neural Networks",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Neural algorithms for placement problems

AU - Urahama, Kiichi

AU - Nishiyuki, Hiroshi

PY - 1993

Y1 - 1993

N2 - Two improved neural algorithms are presented for solving a placement problem which is a familiar class of NP-hard quadratic assignment problems. Formulation of the problem as a zero-one integer programming leads to an improved form of the Hopfield networks, while a mixed integer programming formulation results in an analogue algorithm similar to the elastic nets. The outermost loop in these algorithms performs an automatically scheduled deterministic annealing. This gives us a natural interpretation of the annealing procedure derived straightforwardly from the mathematical programming framework. Experiments reveal that the adaptive elastic net algorithm outperforms the adaptive Hopfield method.

AB - Two improved neural algorithms are presented for solving a placement problem which is a familiar class of NP-hard quadratic assignment problems. Formulation of the problem as a zero-one integer programming leads to an improved form of the Hopfield networks, while a mixed integer programming formulation results in an analogue algorithm similar to the elastic nets. The outermost loop in these algorithms performs an automatically scheduled deterministic annealing. This gives us a natural interpretation of the annealing procedure derived straightforwardly from the mathematical programming framework. Experiments reveal that the adaptive elastic net algorithm outperforms the adaptive Hopfield method.

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

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

M3 - Conference contribution

AN - SCOPUS:0027836014

SN - 0780314212

SN - 9780780314214

VL - 3

SP - 2421

EP - 2424

BT - Proceedings of the International Joint Conference on Neural Networks

PB - Publ by IEEE

ER -