Efficiency of the Misra-Fair Algorithm for the Solution of the Traveling-Salesman Problem.

摘要

The efficiency of the Misra-Fair algorithm for solution of the Traveling-Salesman problem is investigated. A FORTRAN language computer program is written for the Misra-Fair algorithm, Little et al.'s Branch-and-Bound algorithm and the Closest-Unvisited-City algorithm. The accuracy and speed of solution of the programs using the Misra-Fair algorithm is compared to the accuracy and speed of solution of the programs using the Branch-and-Bound algorithm and the Closest-Unvisited-City algorithm. Preliminary computational results and suggestions for improving the computer program are given. (Author)