Toll-Design Problem with Stochastic Route Choice

Mei Chen, David H Bernstein and Lazar N Spasovic
Additional contact information
Mei Chen: Department of Civil Engineering, University of Kentucky, Lexington, KY 40506, USA
David H Bernstein: Department of Computer Science, James Madison University, Harrisonburg, VA 22807, USA
Lazar N Spasovic: School of Management, New Jersey Institute of Technology, University Heights, Newark, NJ 07102, USA

Environment and Planning B, 2004, vol. 31, issue 5, 731-742

Abstract: Congestion pricing has been regarded as an effective method of reducing network-wide travel cost. Previous work on the toll-design problem focused on the deterministic case, that is, it is assumed that travelers have perfect information on the cost of traveling on every route of the network and they always choose the one with the least cost. Limited literature is available on the stochastic case and most of it is focused on marginal social cost pricing with the underlying assumption that all links can be tolled. In this study, a toll-design problem based on stochastic route-choice behavior for multiple user groups is presented under a more realistic context—only a subset of links can be tolled. The methodology is tested with real-world network data. The performance of various algorithms is also discussed.

Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b3022 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:31:y:2004:i:5:p:731-742

DOI: 10.1068/b3022

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().