Routing and Scheduling Coast Guard Buoy Tenders

A. K. Cline, D. H. King and J. M. Meyering
Additional contact information
A. K. Cline: Department of Computer Sciences, The University of Texas, Austin, Texas 78712
D. H. King: D. H. King, Matkowski and Associates, 4012 Marine Drive, West Vancouver, British Columbia, Canada V7V 1N6
J. M. Meyering: Department of Computer Sciences, The University of Texas, Austin, Texas 78712

Interfaces, 1992, vol. 22, issue 3, 56-72

Abstract: We applied a best-schedule heuristic for solving a large class of real-world routing and scheduling problems to the routing and scheduling of buoy maintenance in real time by the United States Coast Guard. The best schedule method reduces a routing and scheduling problem to a traveling salesman problem with non-Euclidean distances. The service windows for the activities are used to prune potential routes without calculating a detailed schedule or evaluating the cost function.

Keywords: transportation: route selection; government: services (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/inte.22.3.56 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orinte:v:22:y:1992:i:3:p:56-72

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().