Research And Application Of Demand Matching And Route Planning Algorithms For Ride-sharing

Ridesharing is an effective solution to ease urban ills including traffic congestion and taxi no load.The current ridesharing services need reservation required and artificial route planning.There exist some problems.For example,regarding taxi matching,the speed of matching is increased at the expense of matching accuracy.Regarding route planning,the method used in the shortest path planning is not clear,which lack of practical significance.We propose a taxi real-time dynamic matching system R-Share which is based RN-tree.When passengers submit a request by their cell phones,R-Share finds a relatively optimal taxi in the current road network for the request.It improves the speed and accuracy of dynamic matching to a certain extent.It is also designed to plan the relative optimal route considered the conditions of detour and passenger tolerance time.We compared to experiments with the current three ride sharing systems on NYC taxi data,it proves that our proposed system is better than others.Given a set of online car-hailing collections and requests,the path planning will find a route for each car,that is,passengers arriving at any time with different optimization goals to get on and off.The sequence of positions.Previous studies lacked practicality due to conflicting goals and inefficiency in the process of inserting new requests into routes.Although these strategies can speed up the process of checking the feasibility of insertion and inserting new requests into the itinerary of the ride-hailing itinerary,it is not clear how much the quality of the selected insertion will be reduced,so our goal is mainly to speed up the calculation of the shortest path algorithm itself.To speed up the insertion process,instead of eliminating the feasibility of certain insertions according to certain circumstances,in this article we propose an algorithm for calculating the shortest path,which can greatly shorten the time required for the calculation of the shortest path algorithm.In the comparative experiment,the New York City online car-hailing data was used to compare with the three online car-hailing systems of T-Share,X-Share and SHAREK,which proved that the system proposed in this paper is superior in speed and accuracy.The above three systems.