Alternative networks for solving the traveling salesman problem and the list-matching problem

Robert D. Brandt, Yao Wang, Alan J. Laub, Sanjit K. Mitra

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

Abstract

The authors demonstrate that Hopfield-type networks can find reasonable solutions to the Traveling Salesman Problem (TSP) and the optimal list-matching problem (LMP). They show how to avoid the difficulties encountered by G.V. Wilson and G.S. Pawley (1988) by using a modified energy functional which yields better solutions to the TSP than J.J. Hopfield and D.W. Tank's (1985) original formulation. In addition, two fixed-parameter networks are described, one for the TSP and the other for the list-matching problem. The performance of the fixed-parameter network for the TSP is comparable to the performance of the modified formulation mentioned which the fixed-parameter network for the list-matching problem is shown to perform better than a simple heuristic method. A major feature of these two networks is that the problem-dependent cost data is contained entirely in the linear term of the energy functional-the quadratic part contains only constraint information. This feature has the advantage that all costs can be presented to the network as inputs rather than as connection weights, eliminating the necessity of modifying the internal parameters with each new set of data. This results in a substantial reduction in hardware complexity.

Original languageEnglish (US)
Title of host publicationIEEE Int Conf on Neural Networks
PublisherPubl by IEEE
Pages333-340
Number of pages8
StatePublished - 1988

Fingerprint

Traveling salesman problem
Heuristic methods
Costs
Hardware

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Brandt, R. D., Wang, Y., Laub, A. J., & Mitra, S. K. (1988). Alternative networks for solving the traveling salesman problem and the list-matching problem. In IEEE Int Conf on Neural Networks (pp. 333-340). Publ by IEEE.

Alternative networks for solving the traveling salesman problem and the list-matching problem. / Brandt, Robert D.; Wang, Yao; Laub, Alan J.; Mitra, Sanjit K.

IEEE Int Conf on Neural Networks. Publ by IEEE, 1988. p. 333-340.

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

Brandt, RD, Wang, Y, Laub, AJ & Mitra, SK 1988, Alternative networks for solving the traveling salesman problem and the list-matching problem. in IEEE Int Conf on Neural Networks. Publ by IEEE, pp. 333-340.
Brandt RD, Wang Y, Laub AJ, Mitra SK. Alternative networks for solving the traveling salesman problem and the list-matching problem. In IEEE Int Conf on Neural Networks. Publ by IEEE. 1988. p. 333-340
Brandt, Robert D. ; Wang, Yao ; Laub, Alan J. ; Mitra, Sanjit K. / Alternative networks for solving the traveling salesman problem and the list-matching problem. IEEE Int Conf on Neural Networks. Publ by IEEE, 1988. pp. 333-340
@inproceedings{09f644b7936f4654b59eb3be9d4c10c3,
title = "Alternative networks for solving the traveling salesman problem and the list-matching problem",
abstract = "The authors demonstrate that Hopfield-type networks can find reasonable solutions to the Traveling Salesman Problem (TSP) and the optimal list-matching problem (LMP). They show how to avoid the difficulties encountered by G.V. Wilson and G.S. Pawley (1988) by using a modified energy functional which yields better solutions to the TSP than J.J. Hopfield and D.W. Tank's (1985) original formulation. In addition, two fixed-parameter networks are described, one for the TSP and the other for the list-matching problem. The performance of the fixed-parameter network for the TSP is comparable to the performance of the modified formulation mentioned which the fixed-parameter network for the list-matching problem is shown to perform better than a simple heuristic method. A major feature of these two networks is that the problem-dependent cost data is contained entirely in the linear term of the energy functional-the quadratic part contains only constraint information. This feature has the advantage that all costs can be presented to the network as inputs rather than as connection weights, eliminating the necessity of modifying the internal parameters with each new set of data. This results in a substantial reduction in hardware complexity.",
author = "Brandt, {Robert D.} and Yao Wang and Laub, {Alan J.} and Mitra, {Sanjit K.}",
year = "1988",
language = "English (US)",
pages = "333--340",
booktitle = "IEEE Int Conf on Neural Networks",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Alternative networks for solving the traveling salesman problem and the list-matching problem

AU - Brandt, Robert D.

AU - Wang, Yao

AU - Laub, Alan J.

AU - Mitra, Sanjit K.

PY - 1988

Y1 - 1988

N2 - The authors demonstrate that Hopfield-type networks can find reasonable solutions to the Traveling Salesman Problem (TSP) and the optimal list-matching problem (LMP). They show how to avoid the difficulties encountered by G.V. Wilson and G.S. Pawley (1988) by using a modified energy functional which yields better solutions to the TSP than J.J. Hopfield and D.W. Tank's (1985) original formulation. In addition, two fixed-parameter networks are described, one for the TSP and the other for the list-matching problem. The performance of the fixed-parameter network for the TSP is comparable to the performance of the modified formulation mentioned which the fixed-parameter network for the list-matching problem is shown to perform better than a simple heuristic method. A major feature of these two networks is that the problem-dependent cost data is contained entirely in the linear term of the energy functional-the quadratic part contains only constraint information. This feature has the advantage that all costs can be presented to the network as inputs rather than as connection weights, eliminating the necessity of modifying the internal parameters with each new set of data. This results in a substantial reduction in hardware complexity.

AB - The authors demonstrate that Hopfield-type networks can find reasonable solutions to the Traveling Salesman Problem (TSP) and the optimal list-matching problem (LMP). They show how to avoid the difficulties encountered by G.V. Wilson and G.S. Pawley (1988) by using a modified energy functional which yields better solutions to the TSP than J.J. Hopfield and D.W. Tank's (1985) original formulation. In addition, two fixed-parameter networks are described, one for the TSP and the other for the list-matching problem. The performance of the fixed-parameter network for the TSP is comparable to the performance of the modified formulation mentioned which the fixed-parameter network for the list-matching problem is shown to perform better than a simple heuristic method. A major feature of these two networks is that the problem-dependent cost data is contained entirely in the linear term of the energy functional-the quadratic part contains only constraint information. This feature has the advantage that all costs can be presented to the network as inputs rather than as connection weights, eliminating the necessity of modifying the internal parameters with each new set of data. This results in a substantial reduction in hardware complexity.

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

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

M3 - Conference contribution

AN - SCOPUS:0024122469

SP - 333

EP - 340

BT - IEEE Int Conf on Neural Networks

PB - Publ by IEEE

ER -