Show simple item record

contributor authorSushant Sharma
contributor authorTom V. Mathew
contributor authorSatish V. Ukkusuri
date accessioned2017-05-08T21:40:21Z
date available2017-05-08T21:40:21Z
date copyrightJuly 2011
date issued2011
identifier other%28asce%29cp%2E1943-5487%2E0000098.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/59059
description abstractConventional transportation network design problems treat origin-destination (OD) demand as fixed, which may not be true in reality. Some recent studies model fluctuations in OD demand by considering the first and the second moment of the system travel time, resulting in stochastic and robust network design models, respectively. Both of these models need to solve the traffic equilibrium problem for a large number of demand samples and are therefore computationally intensive. In this paper, three efficient solution-approximation approaches are identified for addressing demand uncertainty by solving for a small sample size, reducing the computational effort without much compromise on the solution quality. The application and the performance of these alternative approaches are reported. The results from this study will help in deciding suitable approximation techniques for network design under demand uncertainty.
publisherAmerican Society of Civil Engineers
titleApproximation Techniques for Transportation Network Design Problem under Demand Uncertainty
typeJournal Paper
journal volume25
journal issue4
journal titleJournal of Computing in Civil Engineering
identifier doi10.1061/(ASCE)CP.1943-5487.0000091
treeJournal of Computing in Civil Engineering:;2011:;Volume ( 025 ):;issue: 004
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record