Optimal information provision for maximizing flow in a forked lattice

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.