The Shortest Covering Path Problem
Citations Over TimeTop 22% of 2014 papers
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.
Related Papers
- → Shortest path problem with uncertain arc lengths(2011)175 cited
- → Comparison of Variants of Yen's Algorithm for Finding K-Simple Shortest Paths(2022)9 cited
- → Comparison Studies for Different Shortest path Algorithms(2015)20 cited
- Algorithm and its application to N shortest paths problem(2002)
- To Figure Out the First Rth Shortest Path Based on Optimal Floyed Algorithm(2009)