Dynamic Ridesharing Services o The problem of route planning in dynamic ridesharing is very difficult and most existing solutions are heuristic T-share Adaptive Prune Kinetic insertion Greedy DP ICDE 13 [EJOR'111 TVLDB 14 VLDB18 上二r “ sasw mw/h trak- s mee I rEp. he sprial Nsw AM *hwan in 4c山,,P← enter A-m [=2==J Causae ast Ct Insertion Operator: insert a new request into the current routeDynamic Ridesharing Services ⚫ The problem of route planning in dynamic ridesharing is very difficult and most existing solutions are heuristic 7 T-share Adaptive insertion Kinetic Prune GreedyDP [ICDE’13] [EJOR’11] [VLDB’14] [VLDB’18] Insertion Operator: insert a new request into the current route