An Improved Dijkstra-based Algorithm for Resource Constrained Shortest Path

As a variation of the shortest path problem, the resource constrained shortest path problem (RCSPP) has been widely studied in academia and industry. Many related algorithms and Lagrange relaxation technologies have been proposed to solve the RCSPP. The paper presents a new algorithm to solve the RCSPP by improving Dijkstra's algorithm. Firstly, we illustrate the process of solving the RCSPP based on the idea of Dijkstra's algorithm through a simple example. Then, we design an algorithm to realize this process. To improve the running efficiency of the proposed algorithm, we give three empirical hypotheses as Lagrangian relaxation techniques. Next, an improved algorithm is presented to solve the RCSPP based on these three hypotheses. Finally, an example is given to demonstrate the improved algorithm. Compared with Dijkstra's algorithm for the RCSPP, our proposed algorithm can reduce the number of visits to nodes in the network.