Summary

International Symposium on Nonlinear Theory and its Applications

2008

Session Number:A3L-B

Session:

Number:A3L-B4

Efficient Routing Strategy in Traffic Flow

Takayuki Kimura,  Tohru Ikeguchi,  C.K. Tse,  

pp.-

Publication Date:2008/9/7

Online ISSN:2188-5079

DOI:10.34385/proc.42.A3L-B4

PDF download (208.1KB)

Summary:
To alleviate congestion in traffic networks is one of the most important problems to establish effective movements of vehicles. In this paper, we propose a new routing strategy using a memory effect. From the view points in the field of the complex networks, this paper deals with efficient control of flow on the complex networks. Conventional routing strategies use probabilistic rules to route the vehicles on the traffic networks. On the other hand, our proposed method uses a deterministic rule, or the memory effect. The memory effect means how many vehicles are moved through the nodes in the past history. In addition, another reason why we use the memory effect is that every node does not need to communicate the adjacent nodes to route the vehicles to their destinations because the memory effect is the information owned by each node. From the results of the numerical simulations, by using the memory effect, our proposed method reduces the traffic congestion effectively compared with the conventional routing strategies. Then, we confirmed that our proposed strategy effectively routes the vehicles to their destinations.