Dynamic Programming Approaches for Solving Shortest Path Problem in Transportation: Comparison and Application

Li, Xuan; Ye, Xiaofei; Lu, Lili

doi:10.1007/978-981-15-0644-4_12

Cited by 4 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The main postulate in dynamic programming is that the optimality of the overall solution is dependent on the optimal solutions of its sub-problems, and hence allowing the overall division optimization problem into similar sub-problems. The results of the sub-problems are archived for subsequent usages [123]. Given its effectiveness, dynamic programming is commonly used in the least cost or shortest path planning or directed graph search problems, especially for transportation systems [123].…”

Section: Dynamic Programmingmentioning

confidence: 99%

“…The results of the sub-problems are archived for subsequent usages [123]. Given its effectiveness, dynamic programming is commonly used in the least cost or shortest path planning or directed graph search problems, especially for transportation systems [123]. To solve the problem, it requires finding the most efficient path from every vertex to every other vertex in a directed graph as represented in (3.32).…”

Section: Dynamic Programmingmentioning

confidence: 99%

See 1 more Smart Citation

Power and energy management optimization for marine transportation electrification

Hein¹

View full text Add to dashboard Cite

for their unwavering support in various aspects throughout my doctoral study and my work projects. The special thanks go to Prof Xu Yan and Mr. Gary Wilson for aspiring me to pursue Marine Transportation and imparting domain-specific knowledge since I was an intern 6 years ago. I am grateful for their constant guidance, patient, and advice which has allowed me to overcome various obstacles and challenges that I have faced in my research and career development. I would also like to thanks Rolls-Royce@NTU Corporate Lab Directors Prof Josep Pou, and Mr. Luc Scheffer for constantly reviewing the progress of the Ph.D. research and giving necessary guidance. I would also like to thank my Thesis Advisory Committee (TAC) members for reviewing and providing valuable comments to improve my thesis.I would like to acknowledge Nanyang Technological University for allowing me to pursue the doctorate and Rolls-Royce@NTU Corporate Lab for providing me with the Scholarship. I would also like to thank Rolls-Royce and NTU personal for their support, guidance, and collaborations. Special thanks go to my colleagues and friends in Rolls-Royce@NTU Corporate Lab, for their support and kind advice.Finally, I would like to give my deepest appreciation to my parents, brothers, and my fiancee for their constant support and encouragement. In the name of Allah SWT, the Most Gracious and the Most Merciful, I have the strength to finish writing the thesis despite many obstacles and challenges.

show abstract

Section: Dynamic Programmingmentioning

confidence: 99%

Section: Dynamic Programmingmentioning

confidence: 99%

Power and energy management optimization for marine transportation electrification

Hein¹

View full text Add to dashboard Cite

show abstract

Chain-Splitting-Solving-Splicing Approach to Large-Scale OFISP-Modeled Satellite Range Scheduling Problem

Meng,

Liu,

Gao

et al. 2024

IEEE Access

View full text Add to dashboard Cite

Dynamic Programming With Python

Sunitha¹,

Abouali

Galety³

et al. 2023

Advances in Systems Analysis, Software Engineering, and High Performance Computing

View full text Add to dashboard Cite

Algorithms are at the heart of computer programming. They form the basis of all software applications and help to solve complex computational problems. Various problem-solving strategies involve divide and conquer, greedy, recursion, dynamic programming, backtracking, etc. This can be used to solve optimization problems that have overlapping subproblems. It aims to find an optimal solution by breaking down a problem into sub-problems in order to manage the complexity of the problem-solving and remembering their solutions in order to avoid repeating computation time in future steps. Mathematical optimization is a crucial component of dynamic programming, and it allows us to efficiently solve a wide range of problems that involve making decisions over time. This chapter discusses dynamic programming's relevance, mathematical optimization, ability to solve a wide range of issues, important qualities, and top-down and bottom-up problem-solving methodologies. Dynamic programming solves some typical computational problems effectively, and Python code is supplied for reference.

show abstract

Dynamic Programming Approaches for Solving Shortest Path Problem in Transportation: Comparison and Application

Cited by 4 publications

References 16 publications

Power and energy management optimization for marine transportation electrification

Power and energy management optimization for marine transportation electrification

Chain-Splitting-Solving-Splicing Approach to Large-Scale OFISP-Modeled Satellite Range Scheduling Problem

Dynamic Programming With Python

Contact Info

Product

Resources

About