01121597

Component

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

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

This paper investigates the equity and efficiency of pricing strategies in a bimodal transport network with elastic demand and heterogeneous users on the basis of logit-based discrete choice models. The network consists of a railway line and a parallel highway with a bottleneck that provide daily commuting services between a residential area and a workplace. On the basis of two user groups differing in values of time, first-best pricing is shown to remain possible through the use of anonymous charges under the stochastic user equilibrium condition. Second-best pricing is also examined, in which an equity constraint is introduced to ensure that some users, if not all, are at least not worse off from implementing the pricing at expectation level. The efficiency, equity, demand realization, and modal split resulting from various pricing strategies are investigated and numerically validated in a simplified real network connecting the Kowloon urban area to Hong Kong, China, International Airport. It was found that the equity-constrained second-best pricing can result in a win–win situation for society and users. The efficiency and welfare gains depend heavily on the values of time of user groups and the number of users in each group.

01121598

English

pp 43-50

2008

Transportation Research Record: Journal of the Transportation Research Board

9780309126014

Print

Figures (1) ; References (25) ; Tables (4)

Choice models; Economic efficiency; Equity; Modal split; Pricing; Strategic planning; Welfare economics

Hong Kong International Airport

Bimodal networks; Bimodal rail-road transport systems; Elastic demand; Heterogeneous users

Kowloon (China)

Finance; Highways; Planning and Forecasting; Railroads; I10: Economics and Administration; I72: Traffic and Transport Planning

TRIS, TRB

Feb 10 2009 1:32PM

• 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
• 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
• Solution Algorithm for Long-Haul Freight Network Design Using Shipper–Carrier Freight Flow Prediction with Explicit Capacity Constraints