Model and Algorithm for Continuous Time-Varying Shortest Path Problem
by Lu Hu, (College of Traffic & Transportation, Southwest Jiaotong University, P.O. Box 610031, Chengdu, Sichuan, China. E-mail: belief2400@sina.com), Bo Peng, (College of Traffic & Transportation, Southwest Jiaotong University, P.O. Box 610031, Chengdu, Sichuan, China. E-mail: belief2400@sina.com), Yangsheng Jiang, (College of Traffic & Transportation, Southwest Jiaotong University, P.O. Box 610031, Chengdu, Sichuan, China. E-mail: belief2400@sina.com), Gai Zhang, (College of Traffic & Transportation, Southwest Jiaotong University, P.O. Box 610031, Chengdu, Sichuan, China. E-mail: belief2400@sina.com), and Haitao Du, (College of Traffic & Transportation, Southwest Jiaotong University, P.O. Box 610031, Chengdu, Sichuan, China. E-mail: belief2400@sina.com)
Section: Travel Behavior, Simulation, and Transportation Planning, pp. 271-276, (doi: http://dx.doi.org/10.1061/41184(419)46)
Access full text
Purchase Subscription
Permissions for Reuse 
| Document type: |
Conference Proceeding Paper |
| Part of: |
ICTE 2011 |
| Abstract: |
Shortest path problem is a common problem in traffic areas. In an actual traffic network, arc costs are usually time-varying functions, under such condition, the issue how to find a shortest path is called as time-varying shortest path problem, on which there are a few research so far, and these research are 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 shortest path problem under this condition. Therefore, we establish a nonlinear programming model and design a corresponding dynamic Dijkstra algorithm on continuous time-varying path problem, whose correctness and effectiveness are verified through a case study. |
|
