Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
