A Simulation-Based Approximation Algorithm for Dynamic Marginal Cost Pricing

Ampol Karoonsoontawong, Satish Ukkusuri, S. Travis Waller, Kara M. Kockelman


This work offers a simulation-based approximation algorithm for dynamic marginal cost pricing (MCP) congestion pricing that is a direct extension of its static counterpart. The algorithm approximates the time-dependent marginal costs, and is incorporated into the inner approximation dynamic user equilibrium algorithm to evaluate the results of dynamic MCP, which are then compared to static assignment results with MCP from previous study. The status quo and dynamic MCP-on-freeways scenarios are simulated (and then compared) on the Dallas-Fort Worth 35,732-link network. Due to computational requirements for such a large-scale dynamic traffic assignment application, the dynamic MCP scenario is simulated without feedback, and only route choices are permitted to vary. When prices are imposed on freeway users, some minor system benefits are observed, including a delay in the onset of congestion. Dynamic prices vary substantially over the three-hour period of analysis, reflecting changes in freeway congestion. Reasons for any inconsistencies between dynamic and static results are discussed, along with important enhancements to future implementation.

Full Text:


DOI: http://dx.doi.org/10.5399/osu/jtrf.47.4.1131


  • There are currently no refbacks.

© 2010 The Transportation Research Forum
All Rights Reserved
ISSN 1046-1469

Published and Distributed by
Transportation Research Forum
NDSU Dept 2880
P.O. Box 6050
Fargo, ND 58108-6050
Phone: (701)231-7766
Fax: (701)231-1945
Web: http://www.trforum.org/