The Research Of Online Dynamic Ridesharing Problem With Time Window Constrains

Based on the analysis of researches at home and abroad, this thesis presents the limitations of current studies of dynamic ridesharing and explores the problem in the aspects of operational rules and match-making efficiency to figure out how to match the needs and demands of individuals under the constrain of time windows. Besides, the thesis establishs a"one-driver-one-rider"dynamic ridesharing model with its relevant rules and expands the ridesharing selection methods and conditions for individuals on the basis of preference. Further more, a more complicated"one-driver-mutliple-riders"dynamic ridesharing model is explored and its basic assumptions and operational regulations are presented.The thesis designs two match-making methods and develops simulation programs via Netlogo platform. By means of system simulation, assessment is made according to the data, which reveals the impact of system parameters like time window length, user involvement, car speed and the expectional proportion of drivers on system indexes, which include match-making percentage, time-saving percentage and average waiting time of individuals.The research problems of this thesis include"the major influencing factors on the results of system operation","the comparison between different match-macking methods","the influence of preference on the result of system running"and"the trend of system indexes under different combination of system parameters". The results of system simulation show that the length of time window has a greate impact on the performance of dynamic ridesharing, and other system parameters also influence the results in varying degrees. The thesis verifies the significance by regression analysis and ANOVA is used to inspect whether different match-making methods have significant difference in the results of system operaton.