Approximation Techniques for Transportation Network Design Problem under Demand Uncertainty

Abstract

Conventional 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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 13 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.