Microsimulation parking choice and search model to assess dynamic pricing scenarios
Ver/ Abrir
Identificadores
URI: https://hdl.handle.net/10902/29034Registro completo
Mostrar el registro completo DCAutoría
Rodríguez Gutiérrez, Andrés



Fecha
2022-02Derechos
© 2022 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license
Publicado en
Transportation Research Part A: Policy and Practice, 2022, 156, 253-269
Editorial
Elsevier
Enlace a la publicación
Palabras clave
Parking Choice
Parking Simulation Model
Stated Preference
Agent Based Simulation Model
Mixed Logit
Dynamic Parking Pricing Policies
Resumen/Abstract
This article analyses the impact that different parking management policies may have on public roads. Policies were simulated using a new parking model based on two sub models: choice of parking place and search for parking place. The model considers curb traffic and was implemented into a traditional microsimulation traffic software. The parameters for the sub models were estimated from data collected in the city centre of Santander (Spain) and from a stated preferences survey asked to users of parking spaces. The model for testing policies was run on Aimsun simulation software creating a personalised API programmed using Python 3.7. The proposed model was able to dynamically simulate various policies based on charging for on-street parking spaces with fare updates at short time intervals of between 5 and 15 min. A sensitivity analysis was performed on different fare scenarios and considering different levels of information available to the users. As a result, this work demonstrates some benefits of dynamic fares such as reducing searching time, curb induced traffic and emissions as well as a new modal redistribution of parking choice between off-street and on-street supply. On the contrary, dynamic fares implied that users needed to spend a bit more time from their parking location to their destinations.
Colecciones a las que pertenece
- D09 Artículos [449]
- D09 Proyectos de investigación [219]