27 February 2020 in IEEE Access
With the rapid economic development, parking problems have become increasingly prominent due to the city's development model and the emergence of a large number of private cars. Parking management departments around the world focus on intelligent parking system in order to solve parking problems, but most of them are limited to upgrading the parking infrastructure. There is no effective solution from a perspective of the fundamental cause to solve the parking problem. At present, it is generally believed that parking guidance systems can effectively alleviate parking problems and provide drivers and traffic managers with real-time and accurate parking information. As one of the prerequisites of the parking guidance system, the accuracy of the short-term parking demand prediction method determines whether the implementation of the parking guidance scheme can effectively solve the parking problem in a certain area. Based on this, we have studied a short-term parking demand prediction in this paper. First, focusing on the distribution of typical parking arrivals and departures regular pattern, a parking demand prediction model was constructed utilizing the Markov birth and death process, and model parameters were calibrated utilizing curve fitting method and undetermined coefficients method. The simulation environment was set up utilizing the Markov process to verify the accuracy of the availability of parameter estimation method. Secondly, a method for determining the prediction interval based on the parking trend was given for different situations with the parking rush hours and ordinary hours which parking arrival and departure parameters were different. In order to verify the effectiveness of the model in practical applications, parking arrival and departure data from June 17 to June 23, 2019 in Jilin University of Nanling Campus was used to verify the short-term parking demand prediction method proposed in this paper. The results show that the parking demand prediction model proposed in this paper can accurately calibrate model parameters, predict parking demand quickly and effectively and provide theoretical reference and technical support for parking planning and management.
1 January 2014 in Mathematical Problems in Engineering
Short‐time traffic flow prediction is necessary for advanced traffic management system (ATMS) and advanced traveler information system (ATIS). In order to improve the effect of short‐term traffic flow prediction, this paper presents a short‐term traffic flow multistep prediction method based on similarity search of time series. Firstly, the landmark model is used to represent time series of traffic flow data. Then the input data of prediction model are determined through searching similar time series. Finally, the echo state networks model is used for traffic flow multistep prediction. The performance of the proposed method is measured with expressway traffic flow data collected from loop detectors in Shanghai, China. The experimental results demonstrate that the proposed method can achieve better multistep prediction performance than conventional methods.
1 January 2014 in Mathematical Problems in Engineering
To increase the efficiency and precision of large‐scale road network traffic flow prediction, a genetic algorithm‐support vector machine (GA‐SVM) model based on cloud computing is proposed in this paper, which is based on the analysis of the characteristics and defects of genetic algorithm and support vector machine. In cloud computing environment, firstly, SVM parameters are optimized by the parallel genetic algorithm, and then this optimized parallel SVM model is used to predict traffic flow. On the basis of the traffic flow data of Haizhu District in Guangzhou City, the proposed model was verified and compared with the serial GA‐SVM model and parallel GA‐SVM model based on MPI (message passing interface). The results demonstrate that the parallel GA‐SVM model based on cloud computing has higher prediction accuracy, shorter running time, and higher speedup.