Research and Application of Public Traffic Intelligent Dispatching Based on Dynamic Programming Algorithm

DOI

10.2991/fmsmt-17.2017.22How to use a DOI?

Keywords

Dynamic programming algorithm, traffic congestion, OD pair, multi-time dynamic traffic assignment.

Abstract

Because the static traffic assignment can not perfectly reflect status of traffic congestion in actual case and the model of dynamic traffic assignment may cause a huge computation cost, the article combines features of static traffic assignment and the dynamic one and has Dial' algorithm based multi-time dynamic assignment to get a balance between precision of description and computation cost. According to the method in the article, corresponding heuristic procedure is proposed, and it is also examined by numerical example of traffic assignment in situation such as network with different linear and nonlinear traveling function, network with link capacity constraint, one origin one destination and one origin several destinations OD pair paradigm. And it also proposes fitting function proximately reflecting overloaded condition in BPR paradigm and compares assignment results of BPR function with methods from other studies to prove practicality and correctness of multi-time assignment based on Dial's theory in the article..

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Sixian Niu
PY  - 2017/04
DA  - 2017/04
TI  - Research and Application of Public Traffic Intelligent Dispatching Based on Dynamic Programming Algorithm
BT  - Proceedings of the 2017 5th International Conference on Frontiers of Manufacturing Science and Measuring Technology (FMSMT 2017)
PB  - Atlantis Press
SP  - 103
EP  - 106
SN  - 2352-5401
UR  - https://doi.org/10.2991/fmsmt-17.2017.22
DO  - 10.2991/fmsmt-17.2017.22
ID  - Niu2017/04
ER  -