A Strategic Markovian Traffic Equilibrium Model for Capacitated Networks
该研究将静态容量网络中的策略性交通流模型推广到随机用户均衡框架，同时考虑用户对路段成本的不完全认知和饱和路段不可达的概率，并针对无环网络给出了求解算法和数值实验。
In the realm of traffic assignment over a network involving rigid arc capacities, the aim of the present work is to generalize the model of Marcotte, Nguyen, and Schoeb [Marcotte P, Nguyen S, Schoeb A (2004) A strategic flow model of traffic assignment in static capacitated networks. Oper. Res. 52(2):191–212.] by casting it within a stochastic user equilibrium framework. The strength of the proposed model is to incorporate two sources of stochasticity stemming, respectively, from the users’ imperfect knowledge regarding arc costs (represented by a discrete choice model) and the probability of not accessing saturated arcs. Moreover, the arc-based formulation extends the Markovian traffic equilibrium model of Baillon and Cominetti [Baillon JB, Cominetti R ( 2008 ) Markovian traffic equilibrium. Math. Programming 111(1-2):33–56.] through the explicit consideration of capacities. This paper is restricted to the case of acyclic networks, for which we present solution algorithms and numerical experiments.