咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Linear programming models for ... 收藏

Linear programming models for the user and system optimal dynamic Network Design Problem: Formulations, comparisons and extensions

线性编程为用户和系统最佳的动态网络设计问题当模特儿:明确的表达,比较和延期

作     者:Ukkusuri, Satish V. Waller, S. Travis 

作者机构:Rensselaer Polytech Inst Dept Civil & Environm Engn Troy NY 12180 USA Univ Texas Austin Dept Civil Engn Austin TX 78705 USA 

出 版 物:《NETWORKS & SPATIAL ECONOMICS》 (肾脏学)

年 卷 期:2008年第8卷第4期

页      面:383-406页

核心收录:

学科分类:1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0823[工学-交通运输工程] 0812[工学-计算机科学与技术(可授工学、理学学位)] 

基  金:National Science Foundation (NSF) [CMMI-0347005] 

主  题:dynamic traffic assignment equilibrium linear programming network design recourse stochastic programming transportation networks 

摘      要: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.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分