Research On The Ride-sharing Problem With Bilateral Waiting Time

In recent years,the popularity of smart mobile communication equipment and GPS,GIS,RS and other technologies used to carpool provides stable technical support,many areas of domestic and foreign network began to appear about the car ride,more and more people choose to ride the way to travel in the travel.Hop to a certain extent can improve transport efficiency,reduce traffic congestion,save social resources,reduce people’s travel costs.Due to its many advantages,integrated passenger travel has been paid more and more attention by people.More and more researchers have made a more in-depth study on the net about car ride.In this paper,the collection of relevant literature at home and abroad on the relevant literature,the collation of the literature.Most of the previous studies on the passenger car market are only unilateral Market Research on passenger satisfaction.In today’s network environment about the car ride,the driver choose to ride a taxi before are not as simple for the sake of shuttle passengers,now most drivers are more due to reduce travel costs and reduce pollution so just choose green travel by way of travel.So,the driver is the carpool problem in the party is very important,they focus on the humanities by experience travel as passengers,so the research on the driver and passenger satisfaction of the bilateral market more in line with the present actual social life in the carpool problem.Net about car carpool in a variety of models,based on the static ride in to single ride,considering the driver and passenger travel in the bilateral waiting time,to maximize the satisfaction of the passengers and the driver of the two party as the goal to establish the objective function.In this paper,passengers waiting time and passenger travel cost two indicators to quantify the passenger satisfaction,with the actual travel cost and waiting time of the two indicators to quantify the driver’s satisfaction.Finally puts forward the bilateral matching algorithm to obtain the optimal network stability about vehicle path matching set,considering both the driver and passenger preference establishtheir own objective function,and according to the objective function respectively write passengers and the driver’s preference list,matching the optimal stable matching solution using H-R stable bilateral matching algorithm for passenger preference list and the driver.Finally,4 passengers and 4 drivers to single by the example proved the feasibility of the models,and found that the matching algorithm can simultaneously consider two aspects of the driver and passengers will be required,the optimal path of the most stable,and provide some reference on research in order to network about cars.