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.
Neural Network Solves "Traveling-Salesman" Problem
NASA Tech Briefs ; 14 , 12
1990-12-01
Sonstige
Keine Angabe
Englisch
Das asymmetrische Traveling-Salesman-Problem
SLUB | 1981
|Probabilistic Traveling Salesman Problem with Deadlines
Online Contents | 2008
|Probabilistic Traveling Salesman Problem with Deadlines
British Library Online Contents | 2008
|DAN: Decentralized Attention-Based Neural Network for the MinMax Multiple Traveling Salesman Problem
Springer Verlag | 2024
|Heuristic Approach to the Traveling Salesman Problem
NTIS | 1987
|