Show simple item record

dc.contributor.advisorLindsay, Glenn F.
dc.contributor.authorBechtle, Jon Michael
dc.dateSeptember 1984
dc.date.accessioned2012-11-19T23:51:19Z
dc.date.available2012-11-19T23:51:19Z
dc.date.issued1984-09
dc.identifier.urihttp://hdl.handle.net/10945/19542
dc.description.abstractA 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.en_US
dc.description.urihttp://archive.org/details/routinguscgbuoyt1094519542
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.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.en_US
dc.titleRouting a USCG buoytender to service aids to navigation: a case of the traveling salesman problemen_US
dc.typeThesisen_US
dc.contributor.secondreaderWood, R.K.
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentDepartment of Operations Analysis
dc.subject.authorTraveling salesmanen_US
dc.subject.authorTouren_US
dc.subject.authorK-optimalen_US
dc.description.serviceLieutenant, United States Coast Guarden_US
etd.thesisdegree.nameM.S. in Operations Researchen_US
etd.thesisdegree.levelMastersen_US
etd.thesisdegree.disciplineOperations Researchen_US
etd.thesisdegree.grantorNaval Postgraduate Schoolen_US
dc.description.distributionstatementApproved for public release; distribution is unlimited.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record