A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach

Mingyuan Chen and Attahiru Sule Alfa
Additional contact information
Mingyuan Chen: University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2
Attahiru Sule Alfa: University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2

Transportation Science, 1991, vol. 25, issue 3, 215-224

Abstract: 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.

Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.25.3.215 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:25:y:1991:i:3:p:215-224

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().