00821011

Component

https://doi.org/10.3141/1771-18

http://scholar.google.com...Leve&publication_year=2001

The problem of adjusting freight demand matrices to observed flows for multimodal, multicommodity transportation planning is addressed. A model is introduced, and an algorithm is described to solve the corresponding bilevel optimization problem. The algorithm is efficiently implemented by using strategic transportation analysis, an interactive-graphic transportation planning package designed for national and regional strategic analysis and planning of multimode, multiproduct freight transportation. Data from an actual application are used to characterize the performance of the proposed methodology. In conclusion, a number of generalizations and promising developments are presented.

This paper appears in Transportation Research Record No. 1771, Transportation Network Modeling 2001.

English

p. 140-147

2001

Transportation Research Record

0309072298

Figures (2) ; References (16) ; Tables (1)

Algorithms; Demand; Freight transportation; Mathematical models; Matrices (Mathematics); Multimodal transportation; Optimization; Strategic planning; Transportation planning

Interactive graphics

Freight Transportation; Highways; Planning and Forecasting; Railroads; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Dec 13 2001 12:00AM

• ACCELERATING STRATEGIES AND COMPUTATIONAL STUDIES OF THE FRANK-WOLFE ALGORITHM FOR THE TRAFFIC ASSIGNMENT PROBLEM
• ADVANCES IN DISCRETE-TIME DYNAMIC DATA REPRESENTATION WITH APPLICATIONS TO INTELLIGENT TRANSPORTATION SYSTEMS
• ANALYTICAL DYNAMIC NETWORK LOADING PROBLEM: FORMULATION, SOLUTION ALGORITHMS, AND COMPUTER IMPLEMENTATIONS
• ASSESSING FINANCIAL FEASIBILITY OF A BUILD-OPERATE-TRANSFER PROJECT UNDER UNCERTAIN DEMAND
• ASSESSING PERFORMANCE RELIABILITY OF ROAD NETWORKS UNDER NONRECURRENT CONGESTION
• ASSIGNMENT MODELS FOR LOCAL TRUCKLOAD TRUCKING PROBLEMS WITH STOCHASTIC SERVICE TIMES AND TIME WINDOW CONSTRAINTS
• BITWISE ALGORITHM FOR FASTEST PATHS IN TIME-DEPENDENT NETWORKS
• CALIBRATION AND PATH DYNAMICS ISSUES IN MICROSCOPIC SIMULATION FOR ADVANCED TRAFFIC MANAGEMENT AND INFORMATION SYSTEMS
• COMBINED REVEALED AND STATED PREFERENCE NESTED LOGIT ACCESS AND MODE CHOICE MODEL FOR MULTIPLE MASS TRANSIT TECHNOLOGIES
• COMPARISON OF THREE METHODS FOR DYNAMIC NETWORK LOADING
• COMPUTER VISION DETECTION SYSTEM FOR NETWORK MODEL VALIDATION
• COMPUTING FASTEST PATHS IN CONTINUOUS-TIME DYNAMIC NETWORKS WITH PIECEWISE LINEAR LINK TRAVEL-TIME FUNCTIONS
• DECISION SUPPORT SYSTEM FOR SNOW EMERGENCY VEHICLE ROUTING: ALGORITHMS AND APPLICATION
• DESIGN AND IMPLEMENTATION OF PARALLEL DYNAMIC SHORTEST PATH ALGORITHMS FOR INTELLIGENT TRANSPORTATION SYSTEMS APPLICATIONS
• DYNAMIC TRIP ASSIGNMENT-SIMULATION MODEL FOR INTERMODAL TRANSPORTATION NETWORKS
• EFFECTS OF FLOW UPDATE STRATEGIES ON IMPLEMENTATION OF THE FRANK-WOLFE ALGORITHM FOR THE TRAFFIC ASSIGNMENT PROBLEM
• ESTIMATION OF ORIGIN-DESTINATION DEMAND FOR DYNAMIC ASSIGNMENT WITH SIMULTANEOUS ROUTE AND DEPARTURE TIME CHOICE
• EVALUATION WITH TRAFFIC ASSIGNMENT UNDER DEMAND UNCERTAINTY
• GENETIC ALGORITHM FOR THE TIME-DEPENDENT VEHICLE ROUTING PROBLEM
• LEAST EXPECTED TIME HYPERPATHS IN STOCHASTIC, TIME-VARYING MULTIMODAL NETWORKS
• MODELING OF NONLINEAR STOCHASTIC DYNAMIC TRAFFIC FLOW
• ORIGIN-DESTINATION MATRICES ESTIMATED WITH A GENETIC ALGORITHM FROM LINK TRAFFIC COUNTS
• PARAMETRIC EVALUATION FOR ROUTE GUIDANCE SYSTEMS WITH ANALYSIS OF SUSTAINABLE DRIVER COMPLIANCE
• SOLUTION ALGORITHM FOR COMBINED INTERREGIONAL COMMODITY FLOW AND TRANSPORTATION NETWORK MODEL WITH LINK CAPACITY CONSTRAINTS
• STOCHASTIC DYNAMIC NETWORK DESIGN PROBLEM
• TRANSIT VEHICLE ARRIVAL PREDICTION: ALGORITHM AND LARGE-SCALE IMPLEMENTATION