Bilevel programming for the continuous transport network design problem
Bilevel programming for the continuous transport network design problem
复制标题
DOI：
10.1016/j.trb.2004.05.001
复制
发表时间：
2005-05-01
影响因子：
6.8
通讯作者：
Chiou, SW
中科院分区：
文献类型：
--
作者：
Chiou, SW
连续网络设计问题(CNDP)是指确定网络性能指标最优的链路容量扩展集和相应的均衡流。这种均衡网络设计问题可以用双层规划方法来描述。在上层问题中，系统性能指标被定义为链路容量扩展的总旅行时间和投资成本之和。在较低级别的问题上。用户均衡流量由Wardrop第一原理确定，可以表示为一个等价的最小化问题。在这篇文章中，我们通过实现基于梯度的方法来使用下降方法来求解一般的CNDP，其中可以得到Karush-Kuhn-Tucker点。提出了四种基于梯度的方法，并在三种测试网络上与以前的方法进行了广泛的数值比较。在求解均衡分配问题时，特别是在考虑拥堵路网的情况下，所提出的方法在对声母的稳健性和计算效率方面都比其他方法取得了更好的结果。(C)2004爱思唯尔有限公司。保留所有权利。
A Continuous Network Design Problem (CNDP) is to determine the set of link capacity expansions and the corresponding equilibrium flows for which the measures of performance index for the network Is optimal. A bilevel programming technique can be used to formulate this equilibrium network design problem. At the upper level problem, the system performance index is defined as the sum of total travel times and investment costs of link capacity expansions. At the lower level problem. the user equilibrium flow is determined by Wardrop's first principle and can be formulated as an equivalent minimization problem. In this paper we exploit a descent approach via the implementation of gradient-based methods to solve CNDP generally where the Karush-Kuhn-Tucker points can be obtained. Four variants of gradient-based methods are presented and numerical comparisons are widely made with the previous on three kinds of test networks. The proposed methods have achieved substantially better results in terms of the robustness to the initials and the computational efficiency in solving equilibrium assignment problems than did others especially when the congested road networks are considered. (C) 2004 Elsevier Ltd. All rights reserved.