On the distribution schemes for determining flows through a merge

In this paper, we study various distribution schemes for determining flows through a merge in the supply-demand framework. Upon a thorough analysis of existing schemes, we propose a simple distribution scheme that satisfies the "fairness" condition, in which the flow from an upstream link is proportional to its traffic demand. We demonstrate that this scheme can capture major characteristics of a merge, such as differences in link capacities and the control of an on-ramp link. Moreover, this scheme leads to a merge model that is computationally efficient and easy to calibrate. Wave solutions of a general Riemann problem will be of interest in future studies.