Research On Vehicle Dynamic Multiplication Matching Algorithm

With the improvement of material living standards,more and more families began to have private cars.The rapid growth of the number of vehicles in our country,accompanied by traffic congestion,environmental pollution and a series of problems.At the same time,although many vehicles on the road,there are different degrees of taxi difficulties.Blindly widening the road and increasing the number of taxis are not a good solution to this problem.Thus,car-sharing walks into people’s life,using the remaining space on the car as a ride resource.At present,car-sharing has been normalized in Europe and the United States,while it is still in its infancy in China.In the early days,some websites which provided car-sharing information only provided basic information of travel time and starting point and end point,and text-matching techniques made it difficult for passengers and owners to be effectively matched,as a result,it is not widely accepted.Therefore,an effective vehicle matching algorithm is the key to the study of car-sharing.Currently,many scholars focus on studying the problem of deterministic static vehicle matching,lacking consideration of the influence of external factors,such as road traffic situation,the affects of drivers and the passengers.Especially the problem resulted from fixed passengers’ on and off time and location ahead of departure time which is difficult for both drivers and passengers to arrive strictly in accordance with the provisions of the time window,wherever there is a link error,the whole match is likely to be a failure.In this paper,we focus on dynamic matching of vehicles,only the vehicles with real-time location near the passengers can be successfully matched,so as to solve the problem of vehicle arrival time uncertainty.With the aid of the Dijkstra algorithm and the genetic algorithm,the vehicle always gets the newest shortest path as long as the passengers added.And on this basis,Check the time window,calculating the matching degree between passengers and vehicles to determine the matching relation.At the end of this paper,the network with the main trunk road in Kunming is constructed in the simulation system,and the matching process between the passenger and the vehicles is tested,which turns out that the algorithm in this paper can effectively solve the problem of dynamic car-sharing.