Research On Dynamic Taxi Sharing Matching Optimization Algorithm

Along with the speeding up of our country's urbanization construction and the rapid increase in the number of the traffic vehicles,the urban road traffic congestion problem has become a major problem needed to be resolved in the urban development.As an important part of the city's public transportation,taxi is convenient and flexible.However,constrained by the asymmetric information of supply and demand,the difficulty of taking a taxi,the high emptyloading ratio and the high cost of renting operation are seriously hampering the healthy development of the taxi market.So the taxi sharing begins to enter people's life as an effective way to improve the operation capacity and energy efficiency of the taxi.The empirical data shows that the taxi sharing provides an effective way to solve the problem of traffic congestion and of taxi operation.In this paper,the research situation and development trends of taxi sharing at home and abroad are analyzed,and the key technologies of dynamic taxi sharing are analyzed and summarized.The urban road network is partitioned and the GPS tracking data is processed in time and space distribution.The taxi sharing matching optimization algorithm is used to solve the matching problem of taxis dynamic sharing.The above theories and algorithms are verified and evaluated by using GPS data from the city of Xi'an.Main research contents are as follows:(1)The concept,type and organization form of taxi sharing are described,and the technical framework of dynamic taxi sharing service is constructed,and the key technology of dynamic taxi sharing is described in detail.(2)Clear the original GPS tracking data of taxi,and combine the urban road network data with the urban road network,use the DBSCAN clustering algorithm to cluster the taxis' up and down passenger points to get the information about the center node of the grid and the distance between the grids.According to the grid division method,the GPS trajectory of the taxi is processed in time-space distribution.(3)Determine the distance threshold and time threshold values of the passengers with the bilateral matching algorithm,and determine the matching scheme of the passenger and the taxi in the case of meeting constraint conditions.By using the parameters such as the length of road grid,the average speed of the vehicle and the number of vehicles in the road the weight function of road grid is constructed,to obtain the weight matrix table between the road grid nodes.The dynamic path planning model is established by using the road grid interval and the improvement of the A* algorithm,and the path planning of the passenger and taxi is realized through invoking and judging the weight matrix table of the road grid.This paper aims to study the matching problem of taxis dynamic sharing.The use of the dynamic taxi sharing optimization algorithm is more comprehensive,involving multiple parameters in the road network.The experimental results show that the algorithm and model adopted in this paper are feasible in practice,which can be used as reference for the subsequent dynamic taxi sharing study,and it has certain positive significance to the development of the taxi sharing policy.