01095846

Component

https://doi.org/10.3141/2089-10

http://scholar.google.com...egan&publication_year=2008

Freight transportation has long been recognized as an important foundation of economic strength. Previous studies used traditional methods such as cost–benefit analysis to examine a set of scenarios. However, because of the complexity of transportation projects that can have substitution or complementary effects in a network, more scenarios may result than can be examined on a case-by-case basis. To realize optimal network design, a branch and bound method is applied to examine all possible scenarios. The work described in this paper focuses on developing public infrastructure investment decisions to improve freight movements. A freight flow prediction model that focuses on the relationship between shippers, who select types of services, and carriers, who decide how to route vehicles, is used to represent freight route choice behaviors. In addition, explicit capacity constraints are used to divert traffic volume from congested links. The benefits and limitations of the method are discussed, its computational efficiency is examined, and a numerical example is provided. The results indicate that project selection by the traditional case-by-case analysis cannot capture the complexity of freight transportation network improvements and yields a suboptimal solution.

01121598

English

pp 76-84

2008

Transportation Research Record: Journal of the Transportation Research Board

9780309126014

Print

Figures (2) ; References (30) ; Tables (3)

Branch and bound algorithms; Decision making; Forecasting; Freight transportation; Infrastructure; Investments; Mathematical prediction; Network analysis (Planning); Route choice

Capacity constraints; Computational efficiency; Freight flow; Longhaul freight movement; Network design

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

TRIS, TRB, ATRI

Jan 29 2008 5:29PM

• Combination of Multiple Ant Colony System and Simulated Annealing for the Multidepot Vehicle-Routing Problem with Time Windows
• Dynamic Shortest-Path Algorithm for Continuous Arc Travel Times: Implication for Traffic Incident Management
• Efficient Implementation of Improvement Procedures for Vehicle Routing with Time-Dependent Travel Times
• Equity and Efficiency Analysis of Pricing Strategies in a Bimodal Network with Heterogeneous User Groups
• Heuristic Framework for Optimizing Hurricane Evacuation Operations
• Incorporating Environmental Justice Measures into Equilibrium-Based Network Design
• Integrating Equity Objectives in a Road Network Design Model
• Location Routing Approach for the Humanitarian Prepositioning Problem
• Maximal Dynamic Expected Flows Problem for Emergency Evacuation Planning
• New Methodology for Optimizing Transit Priority at the Network Level
• Optimizing Distance-Based Fares and Headway of an Intercity Transportation System with Elastic Demand and Trip Length Differentiation
• Planning Approximations to the Average Length of Vehicle Routing Problems with Varying Customer Demands and Routing Constraints