Interactive Vehicle Assignment to
Travel Requests in Ride-Sharing Systems
s1270253 Ryoya Yoshimoto
Supervisor: Shigeo Takahashi

Outlines
• Motivations
• Objectives
• Methodology
• Result

Outlines
• Motivations
• Objectives
• Methodology
• Result

Motivations
• Growing demand for ride-sharing systems as a cost-effective
means of transportation
• Designing fundamental ride-sharing plans by solving various
scheduling problems
call
pick up

Outlines
• Motivations
• Objectives
• Methodology
• Result

Objectives
• Implementing a system for interactively assigning passengers
and vehicles [1]
Which vehicle should pick up a passenger?

Outlines
• Motivations
• Objectives
• Methodology
• Results

Method for optimization
• Let 𝑣 and 𝑟 be a model of vehicle and requests.
• Each 𝑡 has a vehicle and the requests that the vehicle
handles.

Method for optimization
• Penalty function
If 𝑟
𝑗 is not assigned because of lack of vehicles etc., much
cost will be given as penalty.
𝑗=1
𝑅
𝑐𝑝𝑒𝑛𝑎𝑙𝑡𝑦 ∙ 𝑥𝑗
where 𝑥𝑗 =
1 if 𝑥𝑗 is not assigned
0 otherwise

Method for optimization
Objective function: min 𝑘=1
𝑇
𝑐𝑘 ∙ 𝑡𝑘 + 𝑗=1
𝑅
𝑐𝑝𝑒𝑛𝑎𝑙𝑡𝑦 ∙ 𝑥𝑗
where 𝑡𝑘 =
1 if 𝑡𝑘 is chosen
0 otherwise
where 𝑥𝑗 =
1 if 𝑥𝑗 is not assigned
0 otherwise
Constrains:
∀𝑟
𝑗 ∈R, 𝑇𝑅
𝑡𝑘 + 𝑥𝑗 = 1, 𝑇𝑅 = {𝑘| 𝑡𝑘 is include 𝑟
𝑗}
∀𝑣𝑖 ∈V, 𝑇𝑉
𝑡𝑘 ≤ 1, 𝑉𝑉 = {𝑘| 𝑡𝑘 is include 𝑣𝑖}

Outlines
• Motivations
• Objectives
• Methodology
• Result

Result/Demon
stration
・->Vehicle
・->Pick-up point
・->Drop-off point

References
[1] J. Alonso-Mora et al., “On-Demand High-Capacity Ride-
Sharing via Dynamic Trip-Vehicle Assignment”, PNAS,
114(3), 462-467, 2017. DOI: 10.1073/pnas.1611675114