Routing a USCG buoytender to service aids to navigation: a case of the traveling salesman problem
Bechtle, Jon Michael
Lindsay, Glenn F.
MetadataShow full item record
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 guise 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.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Kayirhan, Alp. (Monterey, California. Naval Postgraduate School, 1994-12);A navigation algorithm to navigate an AUV within a charted environment is presented. The algorithm uses sonar range measurements and incorporates them with a potential function which defines the map of the operation area. ...
New motion planning and real-time localization methods using proximity for autonomous mobile robots Wahdan, Mahmoud A. (Monterey, California. Naval Postgraduate School, 1996-09);One of the most difficult theoretical problems in robotics--motion planning for rigid body robots-- must be solved before a robot can perform real- world tasks such as mine searching and processing. This dissertation ...
Van Reet, Alan R. (Monterey California. Naval Postgraduate School, 2005-06);In the interest of enhancing the capabilities of autonomous underwater vehicles US Naval Operations, controlling vehicle position to follow depth contours presents exciting potential for navigation. Use of a contour ...