Dynamic car sharing and matching method based on time and cost constraints

The invention provides a more universal dynamic car sharing and matching method, which solves the problem of real-time matching of a passenger and an optimal driver meeting the conditions under two constraint conditions of car sharing time and car sharing cost of the passenger. The dynamic car sharing and matching method comprises the three steps of step 1, establishing a dynamic car sharing and matching model including time, cost and a skyline relation model; step 2, establishing a dynamic car sharing data structure including Driver Table, Matching Table, Grid index and the like; and step 3, carrying out dynamic car sharing and matching with core conception of guaranteeing high efficiency of matching through reducing or postponing calculation of a shortest path as possible; meanwhile, through setting a skyline constraint of the driver, the calculated amount of matching is further reduced, and in comparison with the other alternative driver, the matched driver is better in the aspect of time or cost.