NASA Logo, External Link
Facebook icon, External Link to NASA STI page on Facebook Twitter icon, External Link to NASA STI on Twitter YouTube icon, External Link to NASA STI Channel on YouTube RSS icon, External Link to New NASA STI RSS Feed AddThis share icon
 

Record Details

Record 2 of 325
Neural Network Solves "Traveling-Salesman" Problem
Author and Affiliation:
Thakoor, Anilkumar P.(Caltech)
Moopenn, Alexander W.(Caltech)
Abstract: Experimental electronic neural network solves "traveling-salesman" problem. Plans round trip of minimum distance among N cities, visiting every city once and only once (without backtracking). This problem is paradigm of many problems of global optimization (e.g., routing or allocation of resources) occuring in industry, business, and government. Applied to large number of cities (or resources), circuits of this kind expected to solve problem faster and more cheaply.
Publication Date: Dec 01, 1990
Document ID:
19900000621
(Acquired Nov 04, 1995)
Accession Number: 90B10621
Subject Category: ELECTRONIC SYSTEMS
Report/Patent Number: NPO-17807
Document Type: NASA Tech Brief
Publication Information: NASA Tech Briefs; p. P. 22; (ISSN 0145-319X); 14; 12
Publisher Information: United States
Financial Sponsor: NASA; United States
Organization Source: Jet Propulsion Lab., California Inst. of Tech.; Pasadena, CA, United States
Description: In English
Distribution Limits: Unclassified; Publicly available; Unlimited
Rights: No Copyright
NASA Terms: LOGIC CIRCUITS; NEURAL NETS; TRAVELING SALESMAN PROBLEM
Availability Source: National Technology Transfer Center (NTTC), Wheeling, WV
Availability Notes: Additional information available through: National Technology Transfer Center (NTTC), Wheeling, WV 26003, (Tel: 1-800-678-6882).
› Back to Top
Find Similar Records
NASA Logo, External Link
NASA Official: Gerald Steeman
Site Curator: STI Program
Last Modified: August 18, 2011
Contact Us