DHPA: decomposition-enhanced hybrid spatiotemporal modeling for city-scale parking availability forecasting

The growing demand for urban parking has imposed increasingly stringent requirements on the real-time and fine-grained management of parking resources. Accurate parking availability (PA) forecasting is therefore essential for parking guidance and traffic congestion mitigation. Existing PA forecasting methods still face two fundamental challenges: first, non-stationary and multi-scale temporal structures are difficult to model; second, global spatial dependency modeling must balance predictive accuracy against computational efficiency. To address these challenges, this paper proposes DHPA, a decomposition-enhanced hybrid spatio-temporal forecasting framework built upon the DeepPA architecture. In the temporal dimension, DHPA introduces a temporal decomposition block, which explicitly models trend and periodic structures to reduce the difficulty of learning non-stationary temporal patterns, thereby improving the stability and generalization of multi-step forecasting. In the spatial dimension, DHPA introduces a hierarchical spatial learning block, which replaces full-node attention with approximate global interaction and enhances spatial dependency modeling under controlled computational cost. Main experiments on the SINPA dataset show that, over the overall 3-hour forecasting horizon, DHPA reduces the mean absolute error by 1.7% compared with the strongest baseline.

Authors

Institutions

Publication Details

Journal
Complex & Intelligent Systems
Published
2026-08-03
DOI
https://doi.org/10.1007/s40747-026-02374-5
Primary Topic
Smart Parking Systems Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DHPA: decomposition-enhanced hybrid spatiotemporal modeling for city-scale parking availability forecasting

Yufan Wang
Complex & Intelligent Systems
Smart Parking Systems Research
article

DHPA: decomposition-enhanced hybrid spatiotemporal modeling for city-scale parking availability forecasting

Yufan Wang
article en

Abstract

The growing demand for urban parking has imposed increasingly stringent requirements on the real-time and fine-grained management of parking resources. Accurate parking availability (PA) forecasting is therefore essential for parking guidance and traffic congestion mitigation. Existing PA forecasting methods still face two fundamental challenges: first, non-stationary and multi-scale temporal structures are difficult to model; second, global spatial dependency modeling must balance predictive accuracy against computational efficiency. To address these challenges, this paper proposes DHPA, a decomposition-enhanced hybrid spatio-temporal forecasting framework built upon the DeepPA architecture. In the temporal dimension, DHPA introduces a temporal decomposition block, which explicitly models trend and periodic structures to reduce the difficulty of learning non-stationary temporal patterns, thereby improving the stability and generalization of multi-step forecasting. In the spatial dimension, DHPA introduces a hierarchical spatial learning block, which replaces full-node attention with approximate global interaction and enhances spatial dependency modeling under controlled computational cost. Main experiments on the SINPA dataset show that, over the overall 3-hour forecasting horizon, DHPA reduces the mean absolute error by 1.7% compared with the strongest baseline.

Complex & Intelligent Systems
Yunnan University (CN)
Sustainable cities and communities
Openalex Percentile: Top 13%
Smart Parking Systems Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.