The Shortest Covering Path Problem

Timothy J. Niblett and Richard L. Church

International Regional Science Review, 2016, vol. 39, issue 1, 131-151

Abstract: The shortest covering path (SCP) problem involves finding the shortest path between an origin node and a destination node, where the path traverses the network and passes within a maximal covering distance of all nodes of the network. This problem was originally proposed by Current, ReVelle, and Cohon. Since that time researchers have proposed both heuristic and optimal approaches for this problem as well as have developed more general forms, including the maximal covering shortest path problem. From the outset, it has been assumed that any optimal covering path would never loop or double back on itself. This assumption is examined in detail. We demonstrate that this assumption can lead to longer than necessary covering paths. We also present a new, more general construct, which can be used to generate optimal SCPs and demonstrate its use on an example problem.

Keywords: shortest covering paths; location set covering; facility location and design; spatial optimization (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/0160017614550082 (text/html)

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:sae:inrsre:v:39:y:2016:i:1:p:131-151

DOI: 10.1177/0160017614550082

Access Statistics for this article

More articles in International Regional Science Review
Bibliographic data for series maintained by SAGE Publications ().