首页 | 本学科首页   官方微博 | 高级检索  
     


Linear Programming Models for the User and System Optimal Dynamic Network Design Problem: Formulations,Comparisons and Extensions
Authors:Satish V Ukkusuri  S Travis Waller
Affiliation:(1) Transportation Systems Engineering, Department of Civil & Environmental Engineering, Rensselaer Polytechnic Institute, 4032 JEC, Troy, NY 12180, USA;(2) Department of Civil Engineering, University of Texas at Austin, 6.204 ECJ Hall, Austin, TX 78705, USA
Abstract:In this paper we formulate a network design model in which the traffic flows satisfy dynamic user equilibrium conditions for a single destination. The model presented here incorporates the Cell Transmission Model (CTM); a traffic flow model capable of capturing shockwaves and link spillovers. Comparisons are made between the properties of the Dynamic User equilibrium Network Design Problem (DUE NDP) and an existing Dynamic System Optimal (DSO) NDP formulation. Both network design models have different objective functions with similar constraint sets which are linear and convex. Numerical demonstrations are made on multiple networks to demonstrate the efficacy of the model and demonstrate important differences between the DUE and DSO NDP approaches. In addition, the flexibility of the approach is demonstrated by extending the formulation to account for demand uncertainty. This is formulated as a stochastic programming problem and initial test results are demonstrated on test networks. It is observed that not accounting for demand uncertainty explicitly, provides sub-optimal solution to the DUE NDP problem.
Keywords:Dynamic traffic assignment  Equilibrium  Linear programming  Network design  Recourse  Stochastic programming  Transportation networks
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号