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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Neural Network Solves "Traveling-Salesman" Problem


    Contributors:

    Published in:

    Publication date :

    1990-12-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English





    Probabilistic Traveling Salesman Problem with Deadlines

    Campbell, Ann M. | Online Contents | 2008



    Probabilistic Traveling Salesman Problem with Deadlines

    Campbell, A.M. / Thomas, B.W. | British Library Online Contents | 2008


    DAN: Decentralized Attention-Based Neural Network for the MinMax Multiple Traveling Salesman Problem

    Cao, Yuhong / Sun, Zhanhong / Sartoretti, Guillaume | Springer Verlag | 2024