Shortest covering paths and other covering walks: Refinements and prospects for subtour prevention

Abstract

The shortest covering path problem (SCPP) is a network optimization model in which a least-cost route connecting an origin and destination that can be accessed by all demand nodes in a network is sought. Thus, it is applicable to transportation planning tasks such as designing routes for public transit and distribution systems. However, deriving optimal solutions to the SCPP can be challenging as an iterative solution approach is often required. Also, problems can arise in accounting for coverage of network nodes and in the handling of certain types of cycles. To this end, a family of model variants for the SCPP is proposed to remedy these problems and to assist with the identification of covering paths and other walks. Additionally, the case in which the origin node is also the destination node is incorporated into the SCPP framework. A flow-constrained SCPP that does not require an iterative solution process is then proposed to identify optimal walks of different types. The flow-constrained SCPP and its iterative counterpart are solved for all origin-destination pairs in a network and their relative computational characteristics are assessed. The results demonstrate that optimal solutions to the flow-constrained SCPP can be obtained more quickly than those obtained using the iterative approach. The results also provide further evidence of the relevance of cycles, particularly those involving U-turns, in solutions to network routing problems. Together, the proposed refinements, extensions, and documented computational experience will extend the applicability and the utility of the SCPP and its counterpart path covering models.