OPTIMAL DESIGN OF TRANSPORTATION NETWORKS WITH FLUCTUATING DEMANDS. A CASE IN MULTICOMMODITY NETWORKS FLOWS
The problem of designing a transportation network that will best satisfy expected demand for travel among a given set of centers of activity is formulated by identifying for each origin-destination pair, called a commodity of the transportation network, all the alternative routes for travel that meet prespecified criteria and which constitute the set of feasible paths. Modal choice is assumed to be a function of travel time and consequently the model generates expected demands for travel, over alternative routes of different length, from a probability distribution function of travel time associated with each origin-destination pair. (Modified author abstract)
-
Corporate Authors:
Stanford University
Department of Industrial Engineering
Stanford, CA United States 94305 -
Authors:
- Avila, JLA
- Publication Date: 1972-12
Media Info
- Pagination: 203 p.
Subject/Index Terms
- TRT Terms: Algorithms; Benefit cost analysis; Branch and bound algorithms; Commuter service; Computer programs; Demand; Design; Digital computers; Economic analysis; Forecasting; Linear programming; Mathematical models; Mode choice; Needs assessment; Network analysis (Planning); Networks; Optimization; Origin and destination; Public transit; Rapid transit; Routing; Shortest path algorithms; Statistical analysis; Transportation; Travel demand; Travel time; Trees (Mathematics); Urban transportation
- Identifier Terms: U.S. Urban Mass Transportation Administration
- Uncontrolled Terms: Network flows; Transportation models; User needs
- Old TRIS Terms: Modal selection; Optimum design
- Subject Areas: Data and Information Technology; Design; Economics; Operations and Traffic Management; Planning and Forecasting; Society; Transportation (General);
Filing Info
- Accession Number: 00047755
- Record Type: Publication
- Source Agency: National Technical Information Service
- Report/Paper Numbers: RR-1 Final Rpt, UMTA-CA-11-0008
- Files: TRIS
- Created Date: Oct 18 2003 12:00AM