System optimum (SO) routing, wherein the total travel time of all users is minimized, is a holy grail for transportation authorities. However, SO routing may discriminate against users who incur much larger travel times than others to achieve high system efficiency, i.e., low total travel times. To address the inherent unfairness of SO routing, we study the ${\beta}$-fair SO problem whose goal is to minimize the total travel time while guaranteeing a ${\beta\geq 1}$ level of unfairness, which specifies the maximum possible ratio between the travel times of different users with shared origins and destinations. To obtain feasible solutions to the ${\beta}$-fair SO problem while achieving high system efficiency, we develop a new convex program, the Interpolated Traffic Assignment Problem (I-TAP), which interpolates between a fairness-promoting and an efficiency-promoting traffic-assignment objective. We evaluate the efficacy of I-TAP through theoretical bounds on the total system travel time and level of unfairness in terms of its interpolation parameter, as well as present a numerical comparison between I-TAP and a state-of-the-art algorithm on a range of transportation networks. The numerical results indicate that our approach is faster by several orders of magnitude as compared to the benchmark algorithm, while achieving higher system efficiency for all desirable levels of unfairness. We further leverage the structure of I-TAP to develop two pricing mechanisms to collectively enforce the I-TAP solution in the presence of selfish homogeneous and heterogeneous users, respectively, that independently choose routes to minimize their own travel costs. We mention that this is the first study of pricing in the context of fair routing for general road networks (as opposed to, e.g., parallel road networks).
翻译：最优(SO)系统路线,即所有用户的旅行时间全部减少到最低,是运输当局的一个神圣的弱点。然而,最优(SO)路线可能会歧视那些为了实现系统效率而旅行时间比其他用户多得多的用户,即旅行时间少。为了解决SO路线固有的不公平性,我们研究了美元($-Beta)-公平的SO问题,其目标是尽量减少总旅行时间,同时保证1美元($Beta/geq 1)的不公平程度,这明确了不同用户之间旅行时间的最大可能达到的直率比率。然而,为了在达到系统效率的同时,获得对美元($_Beta)-美元($美元)-公平的SO)旅行时间问题的可行解决办法,我们制定了一个新的康韦克斯方案,即国际间交通分配问题(I-Beta)-Pl公平(I-TAP)-TAP($1)-lority)-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-lag-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-leg-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-al-leg-al-al-al-al-leg-al-al-al-al-al-al-al-al-al-al-al-al-al-l-l-al-l-al-al-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-l-
相关内容
微信扫码咨询专知VIP会员