On Some Transportation Management Problems for Ensuring Stable Network Equilibria

保障网络稳定平衡的若干运输管理问题

• 批准号: 07455204
• 负责人: AKAMATSU Takashi
• 金额: $ 2.11万
• 依托单位: TOYOHASHI UNIVERSITY OF TECHNOLOGY
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (B)
• 财政年份: 1995
• 资助国家: 日本
• 起止时间: 1995 至 1996
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-07455204/
• 关键词: Transportation Network; Equilibrium Assignment; Non-saturated Flow; Traffic Capacity Design; Congestion Toll; Optimal Network; Location; Variational Ineguality; 交通ネットワーク分析; 交通政策; 安定的均衡; 数理計画問題

This study proposes a framework for designing / managing transportation networks based on the concept of "stable equilibria" which means that the transportation demand and supply equilibrate within non-saturated region. To consider a policy that ensures the stable equilibria, we first define the following three transportation design / management problems : 1) Upward-shift of transportation performance curves (= "Congestion toll problem"), 2) Right-shift of transportation performance curves (= "Capacity-increase problem"), 3) Downward-shift of transportation demand curves (= "Feasible location problems"). Then, mathematical formulations and analyzes for these respective problems are presented. For the first problem, we first analyze the model under the assumption that network flow pattern is described as the stochastic equilibrium assignment with fixed demand, and it is generalized for the elastic demand case. Our analyzes disclose that the problem can be cast into an equivalent optimiz … More ation problem, and the non-uniqueness of the solution is shown. By using the optimization representation, we develop an efficient algorithm for obtaining the congestion toll pattern in large scale networks. The second problem is found to be solved by a certain network transformation with piece-wise link cost function. The technique reduces the capacity-increase problem to a standard equilibrium assignment, and it enable us to develop solution algorithms for large scale networks. The uniqueness of the capacity-increase pattern is also proved. As for the third problem, we first consider the problem of obtaining the critical OD demand level under the equilibrium condition. The model is then extended to the problem of obtaining a feasible residential / firm location pattern under the transportation-location equilibrium. We find that these problems can be converted into Wardrop equilibrium assignment with fixed demand under the link-capacity conditions. We discuss the non-uniqueness property of the solution, and an efficient method for selecting the unique solution is developed. Less

本研究提出了一个基于“稳定均衡”概念的交通网络设计/管理框架，这意味着在非饱和区域内的交通需求和供给是平衡的。为了考虑确保稳定均衡的政策，我们首先定义以下三个交通设计/管理问题：1）交通性能曲线的上移（=“拥挤收费问题”），2）交通性能曲线的右移（=“容量增加问题”），3）交通需求曲线的下移（=“可行选址问题”）。然后，这些各自的问题的数学公式和分析。对于第一个问题，我们首先在假设网络流模式被描述为固定需求的随机均衡分配的情况下分析模型，并将其推广到弹性需求情况。我们的分析表明，这个问题可以转化为一个等价的优化问题， ...更多信息 问题，并证明了解的非唯一性。通过使用优化表示，我们开发了一个有效的算法来获得大规模网络的拥塞收费模式。第二个问题被发现可以通过一定的网络变换与分段链接成本函数来解决。该技术减少了一个标准的平衡分配的容量增加的问题，它使我们能够开发大规模网络的解决方案的算法。同时证明了容量增长模式的唯一性。对于第三个问题，我们首先考虑在均衡条件下确定临界OD需求水平的问题。然后，该模型扩展到获得一个可行的住宅/企业的位置模式下的交通区位均衡的问题。我们发现，这些问题可以转化为Wardrop均衡分配与固定的需求下的链路容量的条件。我们讨论了解的非唯一性，并给出了一种有效的选择唯一解的方法。少

项目成果

赤松隆: "確率的均衡配分に対する2つのアプローチ" 最適化:モデリングとアルゴリズム. 7. 46-65 (1995)

Takashi Akamatsu：“随机均衡分配的两种方法”优化：建模和算法。7. 46-65 (1995)。

T.Akamatsu: "Three Transportation Management Problems for Ensuring Stable Network Equilibria" Proc.of Infrastructure Planning. 17. 423-426 (1995)

T.Akamatsu：“确保稳定网络平衡的三个运输管理问题”Proc.of 基础设施规划。

赤松隆: "交通均衡モデルとネットワーク最大容量" 土木計画学研究・講演集. 17. 415-418 (1995)

赤松隆：《交通均衡模型与最大网络容量》土木工程规划研究与讲座集。17. 415-418（1995）。

T.Akamatsu: "Cyclic Flow, Markov Process and Stochastic Traffic Assignment" Transportation Research Part B. 30・5. 369-386 (1996)

T.Akamatsu：“循环流、马尔可夫过程和随机交通分配”交通研究 B.30・5（1996）

T.Akamatsu: "Transportation Equilibrium Assignment and Network Capacity" Proc.of Infrastructure Planning. 17. 415-418 (1995)

T.Akamatsu：“交通均衡分配和网络容量”Proc.of 基础设施规划。