Abstract
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.
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.
