liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Decision support for finding locations and toll levels within a congestion pricing scheme
Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för teknik och naturvetenskap.ORCID-id: 0000-0002-1367-6793
Centre for Traffic Research KTH.
Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för teknik och naturvetenskap.ORCID-id: 0000-0001-6405-5914
2008 (engelsk)Inngår i: Transportation Research Board Annual Meeting,2008, Washington D.C.: TRB , 2008Konferansepaper, Publicerat paper (Fagfellevurdert)
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 bi-level 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.

sted, utgiver, år, opplag, sider
Washington D.C.: TRB , 2008.
Emneord [en]
congestion pricing, traffic models
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-42135Lokal ID: 60693OAI: oai:DiVA.org:liu-42135DiVA, id: diva2:262990
Tilgjengelig fra: 2009-10-10 Laget: 2009-10-10 Sist oppdatert: 2015-01-14

Open Access i DiVA

Fulltekst mangler i DiVA

Personposter BETA

Ekström, JoakimRydergren, Clas

Søk i DiVA

Av forfatter/redaktør
Ekström, JoakimRydergren, Clas
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric

urn-nbn
Totalt: 42 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf