城市道路网络的转弯限制研究交通运输规划与管理专业论文.docxVIP

研究生优秀毕业论文 大连理工大学硕士学位论文摘 大连理工大学硕士学位论文 摘 要 城市道路网络的转弯限制作为交通需求管理的一种措施，通过在城市道路网络中选 取最佳的交叉口位置实施转弯限制，达到交通流在城市道路网上的重新分配，此来减少 路网的总体时间花费，提高城市路网的整体运行水平，进而缓解城市拥堵。 本文研究了转弯限制模型构建的具体过程。首先，本文应用改进对偶转化法来准确 地表示出车辆的转弯。随后，建立了转弯限制的双层模型：上层模型从管理决策者的角 度力求城市路网的总体花费最小，下层模型采用固定需求的用户平衡模型。应用变分不 等式的知识将用户平衡模型转化为一个约束条件包涵在上层模型中，转弯限制的双层模 型就可以转化为一个单层的混合整数非线性模型。最后，本文采用有效集算法来解决这 个混合整数非线性规划问题。 虚拟路网和苏福尔斯路网的例子证明了转弯限制模型和有效集算法的合理性与有 效性。 关键词：转弯限制；对偶图；非对称用户平衡；混合整数规划；有效集算法 万方数据 城市道路网络的转弯限制研究Restrict 城市道路网络的转弯限制研究 Restrict Vehicle Turning Movements to Improve the Overall Performance of Urban Transportation Networks Abstract Turning restriction strategy has the potential to improve network performance．This paper investigates the turning restriction design problem that optimizes the turning restriction locations SO as to maximize the improvement Can be made． This paper discusses the process of modeling building of turning restriction．It first transforms a transportation network into a dual graph，where traffic turning movements can be explicitly modeled．Then a bi—level network design problem is proposed．The upper level aims to get the least travel time from the prospect of decision maker while the lower level applies the user equilibrium．The asymmetric user equilibrium is incorporated in the upper level model as a set of nonlinear constraints using variational inequality．A single-level mixed-integer nonlinear formulation is derived for the turning restriction design problem．The active·set algorithm is employed to solve the problem，by sequentially solving a relaxed turning restriction design problem and a design updating problem． Numerical examples performed on six-node network and Sioux Falls network demonstrate the proposed model and solution algorithm． Key Words：turning restriction；dual graph；asymmetric user equilibrium；mixed— integer；active-set algorithm —II— 万方数据 大连理工大学硕士学位论文目 大连理工大学硕士学位论文 目 录 摘 要 ．．1 Abstract．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．．