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


Models and Algorithm for Stochastic Network Designs
Authors:Anthony Chen    Juyoung Kim  Seungjae Lee  Jaisung Choi
Institution:Anthony Chen1,**,Juyoung Kim2,Seungjae Lee3,Jaisung Choi3 1. Department of Civil , Environmental Engineering,Utah State University,Logan,Utah 84322-4110,USA,2. Center for National Transport Database,The Korea Transport Institute,2311 DaehwaDong,Ilsan-Gu,Goyang City,Korea,3. Department of Transportation Engineering,University of Seoul,Dongdaemoon-Ku,Seoul
Abstract:The network design problem (NDP) is one of the most difficult and challenging problems in trans-portation. Traditional NDP models are often posed as a deterministic bilevel program assuming that all relevant inputs are known with certainty. This paper presents three stochastic models for designing transporta-tion networks with demand uncertainty. These three stochastic NDP models were formulated as the expected value model, chance-constrained model, and dependent-chance model in a bilevel programming framew...
Keywords:user equilibrium  traffic assignment  network design  bilevel program  stochastic program
本文献已被 CNKI 万方数据 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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