title: Optimal information provision for maximizing flow in a forked lattice.
abstract: In a forked road, the provision of inappropriate information to car drivers sometimes leads to undesirable situations such as one-sided congestion, which is called the hunting phenomenon in real traffic. To address such problems, we propose a forked exclusion model and investigate the behavior of traffic flow in two routes, providing various types of information to a limited number of traveling particles according to the share rate of information. To analytically understand the phenomena, we develop a coarse-grained representation of the model. By analyzing the model, we find the most effective types of information to minimize particles' travel time and the existence of an optimal share rate according to route conditions.
authors.affiliation: Department of Aeronautics and Astronautics, School of Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan.
authors.forename: Takeaki
authors.initials: T
authors.lastname: Imai
authors.affiliation: Research Center for Advanced Science and Technology, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8904, Japan.
authors.forename: Katsuhiro
authors.initials: K
authors.lastname: Nishinari
mesh_terms: D001334:Automobile Driving; D008962:Models, Theoretical; D013997:Time Factors