IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i17p12716-d1222726.html
   My bibliography  Save this article

TomTom Data Applications for the Assessment of Tactical Urbanism Interventions: The Case of Bologna

Author

Listed:
  • Marco Pozzoni

    (Fondazione Transform Transport ETS, Via Lovanio 8, 20121 Milan, Italy)

  • Giulia Ceccarelli

    (Fondazione Transform Transport ETS, Via Lovanio 8, 20121 Milan, Italy)

  • Andrea Gorrini

    (Fondazione Transform Transport ETS, Via Lovanio 8, 20121 Milan, Italy)

  • Lorenza Manenti

    (citiEU Consultancy Ltd., The Oriel, Sydenham Road, Guildford GU1 3SR, Surrey, UK)

  • Luigi Sanfilippo

    (citiEU Consultancy Ltd., The Oriel, Sydenham Road, Guildford GU1 3SR, Surrey, UK)

Abstract

This work aims to evaluate how a temporary school square implemented in the city of Bologna under the principles of the tactical urbanism approach impacted on vehicular patterns through exploiting TomTom Floating Car Data (FCD) from before and after the intervention. Such data, passively collected by vehicles acting as moving sensors on the network, have been used for the analyses instead of data collected through usual methods. After statistical validation of available datasets through two-tailed paired Student’s t -tests, trend analyses have been performed on sample sizes and speed-related values to detect global variations in the first place, and more thoroughly among clusters of road segments based on graph-calculated distance from the intervention site. Results suggest that traffic flows have been relocated from segments directly affected by the intervention, where a decrease has been registered (−23.87%), towards adjacent streets or segments in a buffer area, which have recorded an increase (+3.51% and +3.50%, respectively), so the phenomenon of traffic evaporation did not take place as opposed to more widespread tactical urbanism interventions described in the literature. OD matrices per 15-min time fractions over the three selected peak time slots have been extracted in order to obtain reliable input data for a future development of traffic microsimulation models. The extraction method is based on least squares optimization problems solving systems of linear equations representing OD flows assigned to the observed link, after selecting a set of k ¯ shortest paths through a Path Size Logit (PSL) model. Even though the availability of large amounts of data could not overcome typical underdetermination of the problem, due to the key issue of data dependence among traffic counts, the validation of retrieved matrices returned good results in terms of correlation between observed and estimated link flows. In the few cases where the quality of correlation fell, underlying causes have been investigated and the influence of outliers, amplified by the high fragmentation of the provided road graph, might represent the core problem.

Suggested Citation

  • Marco Pozzoni & Giulia Ceccarelli & Andrea Gorrini & Lorenza Manenti & Luigi Sanfilippo, 2023. "TomTom Data Applications for the Assessment of Tactical Urbanism Interventions: The Case of Bologna," Sustainability, MDPI, vol. 15(17), pages 1-32, August.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:17:p:12716-:d:1222726
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/17/12716/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/15/17/12716/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yang, Hai & Zhou, Jing, 1998. "Optimal traffic counting locations for origin-destination matrix estimation," Transportation Research Part B: Methodological, Elsevier, vol. 32(2), pages 109-126, February.
    2. Alessandro Cariello & Rossella Ferorelli & Francesco Rotondo, 2021. "Tactical Urbanism in Italy: From Grassroots to Institutional Tool—Assessing Value of Public Space Experiments," Sustainability, MDPI, vol. 13(20), pages 1-15, October.
    3. Demissie, Merkebe Getachew & Kattan, Lina, 2022. "Estimation of truck origin-destination flows using GPS data," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    4. Patrick Bonnel & Mariem Fekih & Smoreda Zbigniew, 2018. "Origin-Destination estimation using mobile network probe data," Post-Print halshs-02114628, HAL.
    5. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    6. Antonello Ignazio Croce & Giuseppe Musolino & Corrado Rindone & Antonino Vitetta, 2021. "Estimation of Travel Demand Models with Limited Information: Floating Car Data for Parameters’ Calibration," Sustainability, MDPI, vol. 13(16), pages 1-23, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Barbara Caselli & Giulia Pedilarco & Gloria Pellicelli & Silvia Rossetti & Michele Zazzi, 2024. "Enhancing Public Space Accessibility and Inclusivity in Residential Neighbourhoods: A Methodological Framework and Pilot Application," Sustainability, MDPI, vol. 16(4), pages 1-27, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rinaldi, Marco & Viti, Francesco, 2017. "Exact and approximate route set generation for resilient partial observability in sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 86-119.
    2. Owais, Mahmoud & Moussa, Ghada S. & Hussain, Khaled F., 2019. "Sensor location model for O/D estimation: Multi-criteria meta-heuristics approach," Operations Research Perspectives, Elsevier, vol. 6(C).
    3. Marković, Nikola & Ryzhov, Ilya O. & Schonfeld, Paul, 2017. "Evasive flow capture: A multi-period stochastic facility location problem with independent demand," European Journal of Operational Research, Elsevier, vol. 257(2), pages 687-703.
    4. Huo, Jinbiao & Liu, Chengqi & Chen, Jingxu & Meng, Qiang & Wang, Jian & Liu, Zhiyuan, 2023. "Simulation-based dynamic origin–destination matrix estimation on freeways: A Bayesian optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    5. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    6. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    7. Bogyrbayeva, Aigerim & Kwon, Changhyun, 2021. "Pessimistic evasive flow capturing problems," European Journal of Operational Research, Elsevier, vol. 293(1), pages 133-148.
    8. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    9. Luss, Hanan & Wong, Richard T., 2005. "Graceful reassignment of excessively long communications paths in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 395-415, January.
    10. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    11. Vitalii Naumov & Andrzej Szarata & Hanna Vasiutina, 2022. "Simulating a Macrosystem of Cargo Deliveries by Road Transport Based on Big Data Volumes: A Case Study of Poland," Energies, MDPI, vol. 15(14), pages 1-23, July.
    12. Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    13. Merkebe Getachew Demissie & Lina Kattan, 2022. "Understanding the temporal and spatial interactions between transit ridership and urban land-use patterns: an exploratory study," Public Transport, Springer, vol. 14(2), pages 385-417, June.
    14. Doan, Xuan Vinh, 2022. "Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning," European Journal of Operational Research, Elsevier, vol. 300(1), pages 73-84.
    15. Hela Masri & Saoussen Krichen, 2018. "Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem," Annals of Operations Research, Springer, vol. 267(1), pages 353-377, August.
    16. Fernández, Elena & Pozo, Miguel A. & Puerto, Justo & Scozzari, Andrea, 2017. "Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 260(3), pages 886-903.
    17. Alessandra Griffa & Mathieu Mach & Julien Dedelley & Daniel Gutierrez-Barragan & Alessandro Gozzi & Gilles Allali & Joanes Grandjean & Dimitri Ville & Enrico Amico, 2023. "Evidence for increased parallel information transmission in human brain networks compared to macaques and male mice," Nature Communications, Nature, vol. 14(1), pages 1-15, December.
    18. Hu, Shou-Ren & Peeta, Srinivas & Chu, Chun-Hsiao, 2009. "Identification of vehicle sensor locations for link-based network traffic applications," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 873-894, September.
    19. Qiang Tu & Han He & Xiaomin Lai & Chuan Jiang & Zhanji Zheng, 2024. "Identifying Critical Links in Degradable Road Networks Using a Traffic Demand-Based Indicator," Sustainability, MDPI, vol. 16(18), pages 1-20, September.
    20. Shao, Hu & Lam, William H.K. & Sumalee, Agachai & Chen, Anthony & Hazelton, Martin L., 2014. "Estimation of mean and covariance of peak hour origin–destination demands from day-to-day traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 52-75.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:15:y:2023:i:17:p:12716-:d:1222726. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.