| Article ID: | iaor1992612 |
| Country: | United States |
| Volume: | 25 |
| Issue: | 3 |
| Start Page Number: | 215 |
| End Page Number: | 224 |
| Publication Date: | Aug 1991 |
| Journal: | Transportation Science |
| Authors: | Alfa Attahiru Sule, Chen Mingyuan |
| Keywords: | programming: network |
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.