Abstract In this article we put forward a simple algorithm for the rapid approximate solution of the single terminal traveling salesman problem. The focus of application of the algorithm is an environment wherein the cost of computation is an important component of the total cost of generating and using a solution. A comparison of several heuristic algorithms is made using three classical problems. The cost of computing and using these solutions is shown to be dependent on the scale of measurement of the problem. Our algorithm is shown to be least costly when computation cost dominates the total cost. The results also give some indications as to when more accurate algorithms should be used.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A rapid heuristic algorithm for the approximate solution of the traveling salesman problem


    Contributors:

    Publication date :

    1974-04-04


    Size :

    5 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Heuristic Approach to the Traveling Salesman Problem

    C. Y. Huang / S. H. Lane | NTIS | 1987



    A heuristic algorithm for traveling salesman problems

    Ashour, Said / Vega, J.F. / Parker, R.G. | Elsevier | 1971


    A heuristic approach to the traveling salesman problem

    HUANG, CHIEN / LANE, STEPHEN | AIAA | 1987