Routing a USCG Buoytender to Service Aids to Navigation: A Case of the Traveling Salesman Problem.

Abstract

A problem of routing a U.S. Coast Guard buoytender to service aids to navigation is formulated as a symmetric traveling salesman problem. A heuristic algorithm is developed which seeks the minimum distance tour which can be taken by the buoytender to visit the aids to navigation. A user's guide is provided. The algorithm is programmed in Convergent Technologies FORTRAN for use on the Coast Guard Standard Terminal. Several problems are solved by the algorithm producing solutions that are optimal or nearly optimal. Keywords include: Traveling salesman, Tour, K-optimal.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1984
Accession Number
ADA151570

Entities

People

  • J. M. Bechtle

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • C4I
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Coast Guard
  • Computations
  • Computer Programming
  • Computers
  • Dynamic Programming
  • Elimination
  • Heuristic Methods
  • Integer Programming
  • Linear Programming
  • Navigation
  • Navigational Aids
  • Operations Research
  • Random Number Generators
  • Standards
  • Terminals
  • United States

Readers

  • Maritime Security/Maritime Homeland Security
  • Operations Research