On May 11th, the Hujiang Economics and Management Forum Series (107th Session) was held in the second conference room on the fourth floor of Building A of the Economics and Management Building. XU Bo, a lecturer in the Department of Information Management and Information Systems, gave an academic report titled Dynamic Robust Shortest Path Problem.
The report shows the shortest path planning problem in transportation, construction, and other route designs, introduces the traditional robust shortest path (RSP) problem, and explains the shortcomings of the traditional RSP problem when facing real-time path planning. A dynamic relative robust shortest path (DRSP) problem was proposed for real-time decision-making applications. A mixed integer programming (MIP) was used to model DRSP, and a heuristic algorithm Nested Dijkstra (ND) was designed to solve it. It has been proven that the model and algorithm can dynamically avoid the occurrence of large regret values (costs) and provide a robust path. The broad application prospects of models and algorithms in traffic path planning and logistics were discussed.
Finally, ZHANG Hao, a lecturer from the Department of Industrial Engineering, gave a review of the lecture. The attending teachers and students had in-depth discussions on the content of the report, mainly focusing on how to apply the model and algorithm to intelligent traffic management and applications.
Translated by Xu Bo
Reviewed by Fang Zhiming
