EFFICIENT ALGORITHMS FOR SOLVING THE SHORTEST COVERING PATH PROBLEM

In this paper the authors introduce heuristic and optimal solution procedures for solving the shortest covering path problem (SCPP). The SCPP was first formulated in CURRENT ET AL. Simply stated, the problem is to identify the minimal cost path on a network from a pre-specified starting node to a pre-specified terminus node. The path must cover all of the nodes on the network. A node is considered covered if it is within some pre-specified maximal covering distance, S, of a node on the path.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    1314 Guilford Avenue
    Baltimore, MD  United States  21202
  • Authors:
    • Current, J
    • Pirkul, H
    • Rolland, E
  • Publication Date: 1994-11

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00672389
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 5 1995 12:00AM