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
Heuristic algorithms for a second-best congestion pricing problem
KTH, School of Architecture and the Built Environment (ABE), Centres, Centre for Traffic Research, CTR.ORCID iD: 0000-0002-4531-8659
2009 (English)In: Netnomics, ISSN 1385-9587, E-ISSN 1573-7071, Vol. 10, no 1, 85-102 p.Article in journal (Refereed) Published
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 toll links, the link toll locations and their corresponding toll level and schedule. In this paper, we develop and evaluate methods for finding the most efficient design for a congestion pricing scheme in a road network model 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 operational costs) of the congestion pricing system. The problem of finding such a scheme is stated as a combinatorial bi-level optimization problem. At the upper level, we maximize the net social surplus and at 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 toll facilities as well. A new heuristic procedure, based on repeated solutions of a continuous approximation of the combinatorial problem is also presented. Numerical results for two small test networks are presented. Both methods perform satisfactorily on the two networks. Comparing the two methods, we find that the continuous approximation procedure is the one which shows the best results.

Place, publisher, year, edition, pages
2009. Vol. 10, no 1, 85-102 p.
Keyword [en]
Bi-level optimization, Collection cost, Congestion pricing, Network design, Toll locations, Traffic assignment, Transport modeling, User equilibrium
National Category
Civil Engineering
Identifiers
URN: urn:nbn:se:kth:diva-153629DOI: 10.1007/s11066-008-9019-9Scopus ID: 2-s2.0-67349198619OAI: oai:DiVA.org:kth-153629DiVA: diva2:752758
Note

QC 20141006

Available from: 2014-10-06 Created: 2014-10-06 Last updated: 2017-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Engelson, Leonid

Search in DiVA

By author/editor
Engelson, Leonid
By organisation
Centre for Traffic Research, CTR
In the same journal
Netnomics
Civil Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 11 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