Research On Vehicle Ride Matching Problem Based On Traffic Flow

With the improvement of living standard, people put forward a higher request to our survivalenvironment. However, a series of serious threats effect the environment just like the currenttraffic congestion, serious environmental pollution and resource waste. These problems are resultof long-term accumulation, is difficult to solve, and need effective and reasonable research fromdifferent views. Vehicle ride matching problem is the kind of question study how to meet thedemands of passengers’ as much as possible in the way of ride matching with a low cost, and itcan decrease the rate of vehicle travel, ease traffic congestion and save resources, protect theenvironment if solve the problem effectively. Therefore, solve the vehicle ride matching problemeffectively can provide a great help for process environment problems.Current research about this problem from a single angle, single vehicle, deterministic aspectmostly, rarely involved in the study of traffic situation, as a result, in the research still existproblems to be solved in the following:(1)Need to solve the deterministic ride matching problem with strict time window and ensurethe universal practical significance to study the problem.(2)Need to consider the traffic flow factors in the road net, and meet the needs that the modelis closely related to real life.This paper choose the topic based on the natural science foundation of Shandong province,in view of the current research situation, take more realistic, more effective and applicability asthe goal to solve the problem, the main innovation and contribution are as follows:(1)Put forward a kind of attractive particle swarm algorithm (APSO) which can solve thedeterministic ride matching problem with strict time window effectively.This paper put forward a kind of APSO algorithm to solve the deterministic ride matchingproblem with strict time window. Firstly, through the first matching process, complete thematching process between passengers and vehicles; Secondly, order demands of passengers’according to the matching results based on the prior knowledge; Finally, optimize the resultthrough the effective mechanism of disturbance. Experimental results show that the algorithm cansolve the problem with strict time window effectively, and lay a foundation to solve morecomplex matching problem based on traffic flow;(2)Introduced the traffic flow factor, put forward a kind of heuristic algorithm, can solve thematching problem based on traffic flow effectively.Based on deterministic matching problem, this paper analyzed the influence of the trafficflow and improved the problem model by increasing the constraint condition and traffic flowfactor in the traffic network, the research of the problem became more practical. First of all,simplify the network structure effectively through the process of road speed clustering; Secondly, solve the problem in the view of static; Again, optimize the result through the dynamic processbased on traffic flow; Finally, optimize the result one times more. Experimental results show thatthe algorithm we proposed can solve the matching problem based on traffic flow effectively.This article discussed the ride matching problem, and described the study process with arealistic mathematic model and method, and solved the problem with traffic flow effectivelybased on the study of deterministic problem, and provided the reference for solving the problemof traffic pressure and environment pollution.