IDEAS home Printed from https://ideas.repec.org/a/sae/envirb/v47y2020i6p948-963.html
   My bibliography  Save this article

An urban big data-based air quality index prediction: A case study of routes planning for outdoor activities in Beijing

Author

Listed:
  • Zhiqiang Zou

    (School of Computer Science, Nanjing University of Posts and Telecommunications, ChinaJiangsu Key Laboratory of Big Data Security and Intelligent Processing, China)

  • Tao Cai

    (School of Computer Science, Nanjing University of Posts and Telecommunications, China)

  • Kai Cao

    (Department of Geography, National University of Singapore, Singapore)

Abstract

Urban big data include various types of datasets, such as air quality data, meteorological data, and weather forecast data. Air quality index is broadly used in many countries as an indicator to measure the air pollution status. This indicator has a great impact on outdoor activities of urban residents, such as long-distance cycling, running, jogging, and walking. However, for routes planning for outdoor activities, there is still a lack of comprehensive consideration of air quality. In this paper, an air quality index prediction model (namely airQP-DNN) and its application are proposed to address the issue. This paper primarily consists of two components. The first component is to predict the future air quality index based on a deep neural network, using historical air quality datasets, current meteorological datasets, and weather forecasting datasets. The second component refers to a case study of outdoor activities routes planning in Beijing, which can help plan the routes for outdoor activities based on the airQP-DNN model, and allow users to enter the origin and destination of the route for the optimized path with the minimum accumulated air quality index. The air quality monitoring datasets of Beijing and surrounding cities from April 2014 to April 2015 (over 758,000 records) are used to verify the proposed airQP-DNN model. The experimental results explicitly demonstrate that our proposed model outperforms other commonly used methods in terms of prediction accuracy, including autoregressive integrated moving average model, gradient boosted decision tree, and long short-term memory. Based on the airQP-DNN model, the case study of outdoor activities routes planning is implemented. When the origin and destination are specified, the optimized paths with the minimum accumulated air quality index would be provided, instead of the standard static Dijkstra shortest path. In addition, a Web-GIS-based prototype has also been successfully developed to support the implementation of our proposed model in this research. The success of our study not only demonstrates the value of the proposed airQP-DNN model, but also shows the potential of our model in other possible extended applications.

Suggested Citation

  • Zhiqiang Zou & Tao Cai & Kai Cao, 2020. "An urban big data-based air quality index prediction: A case study of routes planning for outdoor activities in Beijing," Environment and Planning B, , vol. 47(6), pages 948-963, July.
  • Handle: RePEc:sae:envirb:v:47:y:2020:i:6:p:948-963
    DOI: 10.1177/2399808319862292
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/2399808319862292
    Download Restriction: no

    File URL: https://libkey.io/10.1177/2399808319862292?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Randolph W. Hall, 1986. "The Fastest Path through a Network with Random Time-Dependent Travel Times," Transportation Science, INFORMS, vol. 20(3), pages 182-188, August.
    Full references (including those not matched with items on IDEAS)

    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. Yang, Baiyu & Miller-Hooks, Elise, 2004. "Adaptive routing considering delays due to signal operations," Transportation Research Part B: Methodological, Elsevier, vol. 38(5), pages 385-413, June.
    2. Raymond K. Cheung & B. Muralidharan, 2000. "Dynamic Routing for Priority Shipments in LTL Service Networks," Transportation Science, INFORMS, vol. 34(1), pages 86-98, February.
    3. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    4. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.
    5. Nielsen, Lars Relund & Andersen, Kim Allan & Pretolani, Daniele, 2006. "Bicriterion a priori route choice in stochastic time-dependent networks," CORAL Working Papers L-2006-10, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    6. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    7. Suvrajeet Sen & Rekha Pillai & Shirish Joshi & Ajay K. Rathi, 2001. "A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems," Transportation Science, INFORMS, vol. 35(1), pages 37-49, February.
    8. Tsung-Sheng Chang & Linda K. Nozick & Mark A. Turnquist, 2005. "Multiobjective Path Finding in Stochastic Dynamic Networks, with Application to Routing Hazardous Materials Shipments," Transportation Science, INFORMS, vol. 39(3), pages 383-399, August.
    9. Yueyue Fan & Yu Nie, 2006. "Optimal Routing for Maximizing the Travel Time Reliability," Networks and Spatial Economics, Springer, vol. 6(3), pages 333-344, September.
    10. Pretolani, Daniele, 2000. "A directed hypergraph model for random time dependent shortest paths," European Journal of Operational Research, Elsevier, vol. 123(2), pages 315-324, June.
    11. Matthias Ruß & Gunther Gust & Dirk Neumann, 2021. "The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks," Operations Research, INFORMS, vol. 69(3), pages 709-726, May.
    12. Michel Bierlaire & Frank Crittin, 2006. "Solving Noisy, Large-Scale Fixed-Point Problems and Systems of Nonlinear Equations," Transportation Science, INFORMS, vol. 40(1), pages 44-63, February.
    13. Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
    14. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
    15. Azadian, Farshid & Murat, Alper E. & Chinnam, Ratna Babu, 2012. "Dynamic routing of time-sensitive air cargo using real-time information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 355-372.
    16. Taesung Hwang & Yanfeng Ouyang, 2015. "Urban Freight Truck Routing under Stochastic Congestion and Emission Considerations," Sustainability, MDPI, vol. 7(6), pages 1-16, May.
    17. Zweers, Bernard G. & van der Mei, Rob D., 2022. "Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 178-188.
    18. Prakash, A. Arun, 2018. "Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 127-147.
    19. He Huang & Song Gao, 2018. "Trajectory-Adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times," Transportation Science, INFORMS, vol. 52(1), pages 102-117, January.
    20. Shahabi, Mehrdad & Unnikrishnan, Avinash & Boyles, Stephen D., 2013. "An outer approximation algorithm for the robust shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 58(C), pages 52-66.

    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:sae:envirb:v:47:y:2020:i:6:p:948-963. 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: SAGE Publications (email available below). General contact details of provider: .

    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.