Return to search

Modelling the effects of Stockholm Congestion Charges – A comparison of the two dynamic models: Metropolis and Silvester

Congestion charging has drawn considerable attention of transport analysts and policymakers as a mean of relieving urban traffic congestion. Proper prediction of the impacts of charging is necessary for policy makers to take right decisions. A European project named SILVERPOLIS have been introduced in this connection to describe state-of-practice in modelling effects of congestion charging and to identify features of transport models that are crucial for reliable forecasting of effects of congestion charging. This master thesis is a part of the SILVERPOLIS project, where Stockholm congestion charging scheme has been analysed using two different types of dynamic simulators: METROPOLIS and SILVESTER. The simulations are based on traffic data collected before and after the Stockholm congestion charging trial performed in spring 2006. The result of simulation suggests that METROPOLIS, which has been used for predicting effects of congestion charging in Ile-de-France, manages well to forecast the consequences of congestion charging for Stockholm. Comparison with SILVESTER model disclosed that, although calibration results of the two models differs in some respect, both models give similar results regarding impacts of congestion charging. The different modelling features and assumptions have been described for the two models. Despite the fact that the two models vary a lot in their assumptions and modelling style, both of them has proved to be good at describing the effect of congestion charging.

Identiferoai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-42355
Date January 2011
CreatorsSaifuzzaman, Mohammad
PublisherKTH, Transportvetenskap
Source SetsDiVA Archive at Upsalla University
LanguageEnglish
Detected LanguageEnglish
TypeStudent thesis, info:eu-repo/semantics/bachelorThesis, text
Formatapplication/pdf
Rightsinfo:eu-repo/semantics/openAccess
RelationTSC-MT ; 11-022

Page generated in 0.0027 seconds