MODEL AND ALGORITHM FOR CONTINUOUS TIME-VARYING SHORTEST PATH PROBLEM

The shortest path problem is a common problem in traffic areas. In an actual traffic network, arc costs are usually time-varying functions. Under such conditions, the issue of how to find a shortest path is called a time-varying shortest path problem. There is little research on this so far, and the research is all aiming at the following situations: arc costs are discrete time-varying functions, piecewise functions, or probability distribution functions. However, arc costs are often continuous time-varying, and there is hardly any research on the shortest path problem under this condition. Therefore, the authors establish a nonlinear programming model and design a corresponding dynamic Dijkstra algorithm on a continuous time-varying path problem, whose correctness and effectiveness are verified through a case study.