Data-Driven Optimization for Dynamic Shortest Path Problem Considering Traffic Safety

Traffic congestion is an inescapable problem that frustrates drivers in megacities. Although there is hardly a way to eliminate the congestion, it is possible to mitigate the impact through predictive methods. This paper develops a data-driven optimization approach for the dynamic shortest path problems (DSPP), considering traffic safety for urban navigations. The dynamic risk scores and travel times at different times and locations are estimated by the Safe Route Mapping (SRM) methodology and Long Short-Term Memory (LSTM) with Autoencoder, respectively, where possible variations in the future are considered. The DSPP is formulated as a mixed-integer linear programming problem under risk constraints to minimize the total travel cost, defined as the weighted sum of distance and travel time. To improve the efficiency of the DSPP, we design an improved tabu search with alternative initial-solution algorithms to accommodate various problem scales. Moreover, subgraph and self-adaptive insertion techniques are adopted as acceleration strategies to enhance computational efficiency further. Numerical experiments investigate the computational performance and the solution quality of our algorithm. The result shows satisfactory solution quality and computational efficiency with the proposed acceleration strategies compared to the CPLEX solver, a label-setting algorithm, and a state-of-the-art algorithm. Our algorithm can also compete with Google Maps regarding the travel cost in a real network in Manhattan, NY, USA, which is promising for Urban Navigations.Research Grant from the National Natural Science Foundation of China (Grant Number: 71972133 and 71672112