A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach
-
- Mingyuan Chen
- University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2
-
- Attahiru Sule Alfa
- University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2
書誌事項
- 公開日
- 1991-08
- DOI
-
- 10.1287/trsc.25.3.215
- 公開者
- Institute for Operations Research and the Management Sciences (INFORMS)
この論文をさがす
説明
<jats:p> In this paper, a branch and bound algorithm is presented for solving network design problems (NDP). Route selection for the NDP is based on a stochastic incremental traffic assignment approach. Experiments are performed to compare the behaviors of three assignment methods. Numerical examples are presented to illustrate the algorithm for solving the NDP. </jats:p>
収録刊行物
-
- Transportation Science
-
Transportation Science 25 (3), 215-224, 1991-08
Institute for Operations Research and the Management Sciences (INFORMS)
