10 A Survey on Hop-Constrained Shortest Path Problem and an Improved Algorithm

This paper presents a survey on the Hop-constrained Shortest Path (HSP) problem. And a modified algorithm is proposed by analyzing the features of the optimal solution of the HSP problem. We apply bidirectional breadth-first search strategy to this algorithm, and try to reduce the number of vertices and edges involved in the computational process so as to reduce computing time. And the experimental results show the effectiveness of the proposed algorithm for large-scale network with fewer hops (around 6).