A Unified Approach to Route Planning for Shared mobility Yongxin Tong1, Yuxiang Zeng 2, Zimu Zhou 3 Lei chen 2, Jieping Ye 4, Ke xu 1 Beihang University The Hong Kong University of Science and Technology 3 ETH Zurich 4 Didi Research Institute
A Unified Approach to Route Planning for Shared Mobility Yongxin Tong 1 , Yuxiang Zeng 2 , Zimu Zhou 3 , Lei Chen 2 , Jieping Ye 4 , Ke Xu 1 1 Beihang University 2 The Hong Kong University of Science and Technology 3 ETH Zurich 4 Didi Research Institute
Outline o Background and Motivation ● Problem statement ° Our so| utions ● EXperiments Conclusions
Outline ⚫ Background and Motivation ⚫ Problem Statement ⚫ Our Solutions ⚫ Experiments ⚫ Conclusions 2
Background: Shared Mobility Shared mobility: transportation services that are shared among users o ride sharing, city express, food delivery Ride sharing City Express Food Delivery DIdIeR ST)EXPRESS 顺丰速运 美团 meitan. com seamless Corporation ∪BER
Background: Shared Mobility ⚫ Shared mobility: transportation services that are shared among users. ⚫ ride sharing, city express, food delivery 3 Ride Sharing
Background: Route Planning Route Planning for Shared Mobility(RPSM) o start from orgin, travel 2n location o pickup location the origin of the passenger delivery location: the destination of the passenger e Constraint: first picked up and then delivered icky location delivery location Paris 3e 3 3 2
Background: Route Planning ⚫ Route Planning for Shared Mobility (RPSM) ⚫ start from orgin, travel 2n location ⚫ pickup location: the origin of the passenger ⚫ delivery location: the destination of the passenger ⚫ Constraint: first picked up and then delivered 4 pickup location delivery location 1 1 2 2 3 3
Existing Work ● Disadvantage1: target on only one goal, even conflict goal o e.g., minimizing total distance while trying to serve all requests [ICDE 13, VLDB14 o In another word, not all requests need to be served o That is to say, optimal result is 0, i.e., we do not serve any requests
Existing Work ⚫ Disadvantage 1: ⚫ target on only one goal, even conflict goal o e.g., minimizing total distance while trying to serve all requests [ICDE’13, VLDB’14] o In another word, not all requests need to be served o That is to say, optimal result is 0, i.e., we do not serve any requests 5