Skip to main content
Log in

Simulation-based Analysis for Reducing Traffic Congestion in Real Traffic Networks by Demand Spreading over Time

  • Published:
International Journal of Intelligent Transportation Systems Research Aims and scope Submit manuscript

Abstract

The concept of demand spreading over time has been proven to eliminate traffic congestion for simple networks having one link and a single bottleneck. However, no method has been developed yet to implement this concept in real traffic networks. In this paper, the issues that arise when demand spreading over time is applied to real traffic networks are identified as the first step toward realizing its practical use. A method of solving the identified issues was examined, and its effect was evaluated using a traffic simulation. We found that the method is effective in reducing traffic jams and economic losses.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Shibata, N., Terauchi, T., Kitani, T., Yasumoto, K., Ito, M., Higashino, T.: A method for sharing traffic jam information using inter-vehicle communication. Proc. of 2nd Int. Workshop on Vehicle-to-Vehicle Communications 2006 (V2VCOM 2006), CD-ROM (2006)

  2. Yoshii, T., Ajisawa, S., Kuwahara, M.: Impacts on traffic congestion by switching routes and shifting departure time of trips. Proceedings of 5th World Congress on Intelligent Transport Systems, CD-ROM (1998)

  3. Hendrickson, C., Kocur, G.: Schedule delay and departure time decisions in a deterministic model. Transp. Sci. 15(1), 62–77 (1981)

    Article  Google Scholar 

  4. Smith, M.J.: The existence of a time-dependent equilibrium distribution of arrivals at a single bottleneck. Transp. Sci. 18(4), 385–394 (1984)

    Article  Google Scholar 

  5. Daganzo, C.F.: The uniqueness of a time-dependent equilibrium distribution of arrivals at a single bottleneck. Transp. Sci. 19(1), 29–37 (1985)

    Article  MathSciNet  Google Scholar 

  6. Kuwahara, M.: Equilibrium queuing patterns at a two-tandem bottleneck during the morning peak. Transp. Sci. 24(3), 217–229 (1990)

    Article  MathSciNet  Google Scholar 

  7. Lago, A., Daganzo, C.F.: Spillovers, merging traffic and the morning commute. Trans. Res. B-Meth. 41(6), 670–683 (2007)

    Article  Google Scholar 

  8. Iryo, T., Kuwahara, M.: Simulation analyses of traffic congestion alleviation by demand spreading over time. J. East. Asia Soc. Transp. Stud. 4(4), 161–174 (2001)

    Google Scholar 

  9. Szeto, W.Y., Lo, H.K.: A cell-based simultaneous route and departure time choice model with elastic demand. Trans. Res. B-Meth. 38(7), 593–612 (2004)

    Article  Google Scholar 

  10. Oneyama, H., Iryo, T., Kuwahara, M.: Simulation analysis of traffic congestion alleviation and environment improvement by demand spreading over time in Tokyo Metropolitan area. Proc. Infrastruct. Plan. Rev. Annual Meeting, (JSCE) 24-1, 401–404 (2001). in Japanese

    Google Scholar 

  11. Iryo, T., Kuwahara, M.: Evaluation of a peak load pricing policy considering demand variation within a day. Expressways and Automobiles 45(8), 27–34 (2002). in Japanese

    Google Scholar 

  12. Mori, H.: Development and application of a dynamic network simulator for evaluating road traffic management, Ph.D. thesis, Kobe University, Japan, (2011)

  13. Japan Society of Traffic Engineers: Traffic engineering handbook, (2008)

  14. Ikegami, T., Nishimura, Y.: Improvement of traffic simulation accuracy utilizing prove-car data and drivers’ behavior analysis. Proceedings of 10th World Congress on Intelligent Transport Systems, 3284 (2003)

  15. Japan Society of Traffic Engineers: A manual of standard verification process for traffic flow simulation model, (Draft in English), Available: http://www.jste.or.jp/sim/manuals/VfyManE.pdf

  16. Naniwa National Road Works Office, Available: http://www.kkr.mlit.go.jp/naniwa/ir/traffic_jam/jyutai.htm

Download references

Acknowledgments

The authors are grateful to Ms. Ikegami of Toyota Motor Corporation and the Chubu Regional Bureau for the use of the Toyota City network and valuable data. The authors are also indebted to Prof. Iryo and the other members of Kobe University, and the project members of the Toyota Central R&D Labs., Inc. for their useful suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hiroko Mori.

Appendix 1

Appendix 1

In subsection 2.3, a solution for the four issues is examined. The method that can be realized by an in-vehicle system is proposed. A flow chart for the proposed method is shown in Fig. 8.

Fig. 8
figure 8

Flow chart for proposed method

  • Issue 1: There exist multiple bottlenecks on each route.

    [Proposal] When there exist multiple bottlenecks on the route, there is no way to judge what congestion (or travel) time that each bottleneck accounts for, if it is calculated for the entire route at once. For that reason, the travel time or congestion time, from the origin to the destination, should not be calculated for the entire route at once.

    Rather, the existence/non-existence of congestion should be determined for each link that is passed, and then the overall congestion (or travel) time is summed together.

  • Issue 2: The velocity is not constant.

    [Proposal] The velocity at which a vehicle moves in the upstream part of each link is supposed to be nearly equal to its velocity when the demand spreading over time is applied—i.e., the velocity of the non-congested region. Here, the velocity in the upstream part of each link is supposed to be the velocity of the non-congested region, although the non-congested region does not always exist necessarily during all times. “The travel time excluding congestion time f” is calculated using the velocity at which a vehicle runs in the upstream part of each link. The waiting time w i caused by the traffic congestion in link i is calculated using Eq. A1

    $$ {w^i} = T_r^i - \left( {\frac{{{L^i}}}{{{V^i}}} + T_{{sw}}^i} \right) $$
    (A1)

    where

    \( {T_r}^i \)::

    travel time for link i

    V i::

    velocity at which a vehicle is running, upstream of link i

    L i::

    length of link i

    \( T_{{sw}}^i \)::

    expected signal wait time of link i.

    Here, the expected signal for the wait time \( T_{{sw}}^i \) is calculated with Eq. 4.

  • Issue 3: The reason for any delay is difficult to be distinguished between traffic signals and jams.

    [Proposal] The waiting time \( {w^i} \) of each bottleneck link, which was judged by the solution of Issue 1, is calculated. As shown in Appendix-Fig. 8, if \( {w^i} \) is more than the signal cycle time\( T_{{sc}}^i \), it is judged that “the vehicle was held up by the traffic congestion” and the values of \( {w^i} \) are added.

  • Issue 4: There is a difference in the travel time according to the turn direction.

    [Proposal] Especially when a right turn has to be made at an intersection, the travel time varies according to the number of oncoming vehicles. However, the number of oncoming vehicles cannot be measured because it is assumed that this method is realized by in-vehicle systems. If, therefore, a vehicle turns right at the next intersection and the velocity upstream of the link is low, the vehicle stops not only at the red light but also at the green light. Even though right-turn timing should be calculated based on the flow rate of the oncoming vehicles, in this method, it is assumed that the neighboring links are congested if the link (in which the calculation target vehicle exists) is congested. Then, the expected signal wait time is judged from the velocity for the link in which a vehicle is present. In particular, it is assumed that more than half of the free-flow velocities belong to the free-flow situations and less than half of the free-flow velocities belong to traffic jam situations. If a vehicle turns right and the velocity \( {V^i} \) is less than half of the free-flow velocity \( V_f^i \), the expected signal wait time \( T_{{sw}}^i \) can be calculated using Eq. A2, instead of Eq. 4. Here, \( {V^i} \) is the velocity at which a vehicle travels upstream of link \( i \).

    $$ T_{{sw}}^i = {{{\left( {\frac{{(T_{{sr}}^i + T_{{sg}}^i) \times (T_{{sr}}^i + T_{{sg}}^i)}}{2}} \right)}} \left/ {{T_{{sc}}^i}} \right.} $$
    (A2)

    where

    \( T_{{sg}}^i \)::

    signal time of green light downstream of link \( i \).

The method proposed above can be realized with an in-vehicle system that is not limited to a particular area or region, because the method can be realized by obtaining the velocity at the upstream part of a link. Although traffic signal data currently cannot be obtained by an in-vehicle system, it is thought that these data could be estimated by accumulating probe data.

As explained above, we proposed the method of the demand spreading over time considering the following four points: (1) the existence of multiple bottlenecks on each route, (2) the difference in the velocity of vehicles, (3) the need to distinguish between traffic signals and traffic jams, and (4) the difference in the travel time caused by the turn direction.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mori, H., Kitaoka, H. & Asakura, Y. Simulation-based Analysis for Reducing Traffic Congestion in Real Traffic Networks by Demand Spreading over Time. Int. J. ITS Res. 10, 93–100 (2012). https://doi.org/10.1007/s13177-012-0045-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13177-012-0045-5

Keywords

Navigation