Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Decision support for finding locations and toll levels within a congestion pricing scheme
(Centrum för trafikforskning)
KTH, School of Architecture and the Built Environment (ABE), Transport and Economics (closed 20110301). (Centrum för trafikforskning)ORCID iD: 0000-0002-4531-8659
(Centrum för trafikforskning)
2008 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Designing a congestion pricing scheme involves a number of complex decisions. Focusing on the quantitative parts of a congestion pricing system with link tolls, the problem involves finding the number of tolled links, the link toll locations and their corresponding toll level and schedule. In this paper, we develop and evaluate methods for finding a most efficient design of a congestion pricing scheme in a road network with elastic demand. The design efficiency is measured by the net social surplus, which is computed as the difference between the social surplus and the collection costs (i.e. setup and operation cost) of the congestion pricing system. The problem of finding such a scheme is stated as a combinatorial bilevel optimization problem. On the upper level we maximize the net social surplus and on the lower level we solve a user equilibrium problem with elastic demand, given the toll locations and toll levels, to simulate the user response. We modify a known heuristic procedure for finding the optimal locations and toll levels given a fixed number of tolls to locate, to find the optimal number of tolls to locate as well. A new heuristic procedure is also presented which is based on repeated solutions of a continuous approximation of the combinatorial problem. Numerical results for two small scale test networks are presented. Both methods perform satisfactory on the two networks. Comparing the two methods, the iterative approximation procedure is the one which shows the best results. The results are compared to solutions obtained by an exhaustive search.

Place, publisher, year, edition, pages
2008.
Series
Transportation Research Board Annual Meeting 2008 Paper, 08-0186
National Category
Transport Systems and Logistics
Identifiers
URN: urn:nbn:se:kth:diva-10798OAI: oai:DiVA.org:kth-10798DiVA: diva2:227989
Conference
Transportation Research Board 87th Annual Meeting, Washington D.C., January 2008
Note
QC 20111109Available from: 2009-07-22 Created: 2009-07-22 Last updated: 2011-11-09Bibliographically approved

Open Access in DiVA

No full text

Authority records BETA

Engelson, Leonid

Search in DiVA

By author/editor
Engelson, Leonid
By organisation
Transport and Economics (closed 20110301)
Transport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 37 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf