A deterministic connectionist machine for the traveling salesman problem

Jun Wang

doi:10.1109/ICSMC.1990.142130

A deterministic connectionist machine for the traveling salesman problem

Jun Wang

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

10 Citations (Scopus)

Abstract

A deterministic connectionist machine for solving the traveling salesman problem (TSP) is proposed. The original TSP is reformulated as a penalty problem, i.e., an unconstrained nonlinear programming problem with penalty terms. A deterministic connectionist machine is designed to realize the solution procedure for the penalty problem. The major feature of the machine is that the penalty parameter increases as the states evolve, so the generated tours are always valid. The stability of state trajectories and feasibility of the generated solutions for the proposed connectionist machine are theoretically and practically justified. An algorithm for simulation is presented and the results of numerical simulations on sequential computer are reported.

Original language	English
Title of host publication	1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings
Publisher	IEEE
Pages	374-375
ISBN (Print)	0879425970
DOIs	https://doi.org/10.1109/ICSMC.1990.142130
Publication status	Published - Nov 1990
Externally published	Yes
Event	1990 IEEE International Conference on Systems, Man, and Cybernetics - Sheraton Universal Hotel, Los Angeles, United States Duration: 4 Nov 1990 → 7 Nov 1990

Publication series

Name
ISSN (Electronic)	0884-3627

Conference

Conference	1990 IEEE International Conference on Systems, Man, and Cybernetics
Place	United States
City	Los Angeles
Period	4/11/90 → 7/11/90

Access Output

10.1109/ICSMC.1990.142130

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{66820c4071fd4902948b7ee4c5dc087f,

title = "A deterministic connectionist machine for the traveling salesman problem",

abstract = "A deterministic connectionist machine for solving the traveling salesman problem (TSP) is proposed. The original TSP is reformulated as a penalty problem, i.e., an unconstrained nonlinear programming problem with penalty terms. A deterministic connectionist machine is designed to realize the solution procedure for the penalty problem. The major feature of the machine is that the penalty parameter increases as the states evolve, so the generated tours are always valid. The stability of state trajectories and feasibility of the generated solutions for the proposed connectionist machine are theoretically and practically justified. An algorithm for simulation is presented and the results of numerical simulations on sequential computer are reported.",

author = "Jun Wang",

year = "1990",

month = nov,

doi = "10.1109/ICSMC.1990.142130",

language = "English",

isbn = "0879425970",

publisher = "IEEE",

pages = "374--375",

booktitle = "1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings",

address = "United States",

note = "1990 IEEE International Conference on Systems, Man, and Cybernetics ; Conference date: 04-11-1990 Through 07-11-1990",

}

TY - GEN

T1 - A deterministic connectionist machine for the traveling salesman problem

AU - Wang, Jun

PY - 1990/11

Y1 - 1990/11

N2 - A deterministic connectionist machine for solving the traveling salesman problem (TSP) is proposed. The original TSP is reformulated as a penalty problem, i.e., an unconstrained nonlinear programming problem with penalty terms. A deterministic connectionist machine is designed to realize the solution procedure for the penalty problem. The major feature of the machine is that the penalty parameter increases as the states evolve, so the generated tours are always valid. The stability of state trajectories and feasibility of the generated solutions for the proposed connectionist machine are theoretically and practically justified. An algorithm for simulation is presented and the results of numerical simulations on sequential computer are reported.

AB - A deterministic connectionist machine for solving the traveling salesman problem (TSP) is proposed. The original TSP is reformulated as a penalty problem, i.e., an unconstrained nonlinear programming problem with penalty terms. A deterministic connectionist machine is designed to realize the solution procedure for the penalty problem. The major feature of the machine is that the penalty parameter increases as the states evolve, so the generated tours are always valid. The stability of state trajectories and feasibility of the generated solutions for the proposed connectionist machine are theoretically and practically justified. An algorithm for simulation is presented and the results of numerical simulations on sequential computer are reported.

UR - https://www.scopus.com/pages/publications/0025514649

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0025514649&origin=recordpage

U2 - 10.1109/ICSMC.1990.142130

DO - 10.1109/ICSMC.1990.142130

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 0879425970

SP - 374

EP - 375

BT - 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings

PB - IEEE

T2 - 1990 IEEE International Conference on Systems, Man, and Cybernetics

Y2 - 4 November 1990 through 7 November 1990

ER -

A deterministic connectionist machine for the traveling salesman problem

Abstract

Publication series

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this