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)
Optimal Design of Transportation Networks with Fluctuating Demands. A Case in Multicommodity Networks Flows
1972
203 pages
Report
Keine Angabe
Englisch
Transportation & Traffic Planning , Operations Research , Urban transportation , Transportation models , Mass transportation , Network flows , Benefit cost analysis , Linear programming , Trees(Mathematics) , Routing , Economic analysis , Demand(Economics) , Statistical analysis , Computer programs , Optimization , Digital computers , Algorithms , Integer programming , Sensitivity analysis , Branch and bound method , Shortest route problem
Multiattribute multicommodity flows in transportation networks
Elsevier | 1991
Investment Selection Model for Multicommodity Multimodal Transportation Networks
Transportation Research Record | 1996
|Investment Selection Model for Multicommodity Multimodal Transportation Networks
Online Contents | 1996
|Investment Selection Model for Multicommodity Multimodal Transportation Networks
Transportation Research Record | 1996
|Investment Selection Model for Multicommodity Multimodal Transportation Networks
British Library Conference Proceedings | 1996
|