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
项目状态：
已结题

项目摘要

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 均衡分配问题，并讨论了解决方案的非唯一性，以及选择唯一性的有效方法。解决方案开发较少。