Scholarlink

<p>This paper introduces a novel approach to urban traffic assignment by incorporating path-based utility functions based on the remaining capacity concept, aiming to balance fairness and efficiency while accounting for link capacities and broader equity considerations rather than solely minimizing travel time. The proposed approach ensures a more equitable distribution of flows across different routes, moving beyond the conventional focus on total travel time to integrate additional benefits, such as improved conditions for non-road users. This perspective is particularly critical in urban environments, especially downtown areas, where fair and sustainable transportation planning is essential. Methodologically, we formulate an optimization problem based on the principle of <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\alpha\)</EquationSource> </InlineEquation>-fairness, a generalization of Kelly’s proportional fairness and the Nash bargaining solution, widely applied in computer and wireless networks. The Sequential Quadratic Programming (SQP) method is employed to solve the optimization problem efficiently. By adapting <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\alpha\)</EquationSource> </InlineEquation>-fairness to traffic assignment for the first time, this study bridges transportation and computer engineering, fostering interdisciplinary research in resource allocation challenges shared by both fields. We illustrate our new methodology through a set of numerical simulations, demonstrating the effectiveness of the proposed path-based utility functions in balancing fairness and system efficiency. The proposed methodology effectively mitigates urban traffic congestion while ensuring a fair distribution of network resources. Based on the defined fairness measure, the approach achieves high fairness scores while sacrificing only 3–5% of efficiency.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Towards a Fair Path Flow Distribution in a Transportation Network

  • 期刊论文

  • 发表日期：

    2026年3月16日

查看全文
  • Mohammad Mahdi Zareian,
  • Ahmad Mahmoodjanlou,
  • Lina Kattan

摘要

This paper introduces a novel approach to urban traffic assignment by incorporating path-based utility functions based on the remaining capacity concept, aiming to balance fairness and efficiency while accounting for link capacities and broader equity considerations rather than solely minimizing travel time. The proposed approach ensures a more equitable distribution of flows across different routes, moving beyond the conventional focus on total travel time to integrate additional benefits, such as improved conditions for non-road users. This perspective is particularly critical in urban environments, especially downtown areas, where fair and sustainable transportation planning is essential. Methodologically, we formulate an optimization problem based on the principle of \(\alpha\) -fairness, a generalization of Kelly’s proportional fairness and the Nash bargaining solution, widely applied in computer and wireless networks. The Sequential Quadratic Programming (SQP) method is employed to solve the optimization problem efficiently. By adapting \(\alpha\) -fairness to traffic assignment for the first time, this study bridges transportation and computer engineering, fostering interdisciplinary research in resource allocation challenges shared by both fields. We illustrate our new methodology through a set of numerical simulations, demonstrating the effectiveness of the proposed path-based utility functions in balancing fairness and system efficiency. The proposed methodology effectively mitigates urban traffic congestion while ensuring a fair distribution of network resources. Based on the defined fairness measure, the approach achieves high fairness scores while sacrificing only 3–5% of efficiency.