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

Abstract

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1976
Accession Number
ADA041009

Entities

People

  • Walter E. Smythe

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Compilers
  • Computer Programming
  • Computer Programs
  • Computers
  • Dynamic Programming
  • Efficiency
  • Engineering
  • Errors
  • Integer Programming
  • Language
  • Literature Surveys
  • Maintenance
  • Mathematical Programming
  • Optimization
  • Training
  • Universities

Fields of Study

  • Computer science

Readers

  • Computational Fluid Dynamics (CFD)
  • Computer Science.
  • Marine Propulsion Engineering and Naval Architecture