Asymptotic properties of bike-sharing systems Nicolas Gast 1 SICSA - - PowerPoint PPT Presentation

asymptotic properties of bike sharing systems
SMART_READER_LITE
LIVE PREVIEW

Asymptotic properties of bike-sharing systems Nicolas Gast 1 SICSA - - PowerPoint PPT Presentation

Asymptotic properties of bike-sharing systems Nicolas Gast 1 SICSA workshop Edinburgh, May 2016 1. j.w. with Christine Fricker (Inria), Vincent Jost (CNRS), Ariel Waserhole (ENSTA) homogeneous Heterogeneous Control Conclusion and future


slide-1
SLIDE 1

Asymptotic properties of bike-sharing systems

Nicolas Gast 1 SICSA workshop – Edinburgh, May 2016

  • 1. j.w. with Christine Fricker (Inria), Vincent Jost (CNRS), Ariel Waserhole (ENSTA)

homogeneous Heterogeneous Control Conclusion and future work 1/28

slide-2
SLIDE 2

Question : What is your experience of bike-sharing systems ?

homogeneous Heterogeneous Control Conclusion and future work 2/28

slide-3
SLIDE 3

Question : What is your experience of bike-sharing systems ?

◮ Problems : lack of resources.

homogeneous Heterogeneous Control Conclusion and future work 2/28

slide-4
SLIDE 4

Bike-sharing systems

homogeneous Heterogeneous Control Conclusion and future work 3/28

slide-5
SLIDE 5

Bike-sharing systems

Use it for a while take an bike return it

homogeneous Heterogeneous Control Conclusion and future work 3/28

slide-6
SLIDE 6

I will focus on large bike-sharing systems

Map of Velib’ stations in Paris (France). Example of Velib’ :

◮ 20 000 bikes ◮ 1 200 stations.

homogeneous Heterogeneous Control Conclusion and future work 4/28

slide-7
SLIDE 7

Goal : model the randomness of BSSs

λ(t) take an bike Closed-queuing networks Scaling : N → ∞ stations, s bikes per station.

homogeneous Heterogeneous Control Conclusion and future work 5/28

slide-8
SLIDE 8

Goal : model the randomness of BSSs

λ(t) take an bike Use it for a while Expo(1/µ) Closed-queuing networks Scaling : N → ∞ stations, s bikes per station.

homogeneous Heterogeneous Control Conclusion and future work 5/28

slide-9
SLIDE 9

Goal : model the randomness of BSSs

λ(t) take an bike Use it for a while Expo(1/µ) return it Routing matrix P(t) if station full Closed-queuing networks Scaling : N → ∞ stations, s bikes per station.

homogeneous Heterogeneous Control Conclusion and future work 5/28

slide-10
SLIDE 10

A few questions...

◮ Are there some typical regimes ? ◮ What is the optimal fleet sizes ? ◮ What should be the station capacity ? ◮ What is the impact of redistribution or incentives ?

Is the performance monotone ?

homogeneous Heterogeneous Control Conclusion and future work 6/28

slide-11
SLIDE 11

Main message

Theoretical results : When the system is large :

◮ if the stations have finite capacities, the performance is continuous in

the fleet size.

◮ if the stations have infinite capacities, there are problems of

concentration. Practical considerations :

◮ Performance is poor, even for a symmetric city (but simple incentives

like a two-choice rule can help a lot).

◮ Frustrating users can help :

◮ It is better to have stations of finite capacities. ◮ Frustrating some users can improve the overall usage. ◮ We show that the optimal fleet size is not homogeneous Heterogeneous Control Conclusion and future work 7/28

slide-12
SLIDE 12

Outline

Detailed study of the homogeneous case Adding some heterogeneity Improvement by frustrating some demand Conclusion and future work

homogeneous Heterogeneous Control Conclusion and future work 8/28

slide-13
SLIDE 13

The homogeneous model

◮ All stations are identical.

Motivation :

◮ Impact of random choices ◮ Close-form results ◮ “Best-case analysis”

“Theorem”

Asymptotically, stations are independent and behaves as a M/M/1/K.

homogeneous Heterogeneous Control Conclusion and future work 9/28

slide-14
SLIDE 14

Distribution of xi, the fraction of station with i bikes

Theorem

There exists ρ, such that in steady state, as N goes to infinity : xi ∝ ρi. ρ ≤ 1 iff s ≤ C

2 + λ µ where s be the average number of bikes per stations.

s < C

2 + λ µ

s = C

2 + λ µ

s > C

2 + λ µ

ρ < 1 ρ = 1 ρ < 1

homogeneous Heterogeneous Control Conclusion and future work 10/28

slide-15
SLIDE 15

Consequences : optimal performance for s ≈ C/2

y-axis : Prop. of problematic stations. x-axis : number of bikes/station s.

5 10 15 20 25 30 35 40 45 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Number of bikes per station: s Proportion of problematic stations

λ/µ=1 λ/µ=10

(a) C = 30.

20 40 60 80 100 120 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Number of bikes per station: s Proportion of problematic stations

λ/µ=1 λ/µ=10

(b) C = 100.

Fraction of problematic stations (=empty+full) minimal for s=λ/µ + C/2

◮ Prop. of problematic stations is at least 2/(C + 1) (6.5% for C = 30)

homogeneous Heterogeneous Control Conclusion and future work 11/28

slide-16
SLIDE 16

Improvement by dynamic pricing : “two choices” rule

◮ Users can observe the occupation of stations. ◮ Users choose the least loaded among 2 stations close to destination to

return the bike (ex : force by pricing)

homogeneous Heterogeneous Control Conclusion and future work 12/28

slide-17
SLIDE 17

Improvement by dynamic pricing : “two choices” rule

◮ Users can observe the occupation of stations. ◮ Users choose the least loaded among 2 stations close to destination to

return the bike (ex : force by pricing) Paradigm known as “the power of two choices” :

◮ Comes from balls and bills [Azar et al. 94] ◮ Drastic improvement of service time in server farm [Vvedenskaya 96,

Mitzenmacher 96] Question : what is the effect on bike-sharing systems ? Characteristics :

  • 1. Finite capacity of stations.
  • 2. Strong geometry : choice among neighbors.

homogeneous Heterogeneous Control Conclusion and future work 12/28

slide-18
SLIDE 18

Two choices – finite capacity but no geometry

With no geometry, we can solve in close-form.

◮ Proof uses mean field argument.

Choosing two stations at random, decreases problems from 2/C to 2−C/2

homogeneous Heterogeneous Control Conclusion and future work 13/28

slide-19
SLIDE 19

Two choices – taking geometry into account is hard

Mean field do not apply (geometry) :(.

◮ Existing results for balls and bins (see [Kenthapadi et al. 06]) ◮ Only numerical results exists for server farms (ex : [Mitzenmacher 96])

We rely on simulation Occupancy of stations

x-axis = occupation of station. y-axis : proportion of stations.

Recall : with no incentives, the distribution would be uniform.

◮ Simulation indicate that 2D model is close to no-geometry ◮ Pair-approximation can be used but no close-form [Gast 2015]

homogeneous Heterogeneous Control Conclusion and future work 14/28

slide-20
SLIDE 20

Outline

Detailed study of the homogeneous case Adding some heterogeneity Improvement by frustrating some demand Conclusion and future work

homogeneous Heterogeneous Control Conclusion and future work 15/28

slide-21
SLIDE 21

We assume that as N goes to infinity, the parameters (λi, pi) of the station have a limiting distribution.

homogeneous Heterogeneous Control Conclusion and future work 16/28

slide-22
SLIDE 22

We assume that as N goes to infinity, the parameters (λi, pi) of the station have a limiting distribution.

“Theorem”

When the stations have finite capacities, a station behaves as a M/M/1/K.

homogeneous Heterogeneous Control Conclusion and future work 16/28

slide-23
SLIDE 23

Finite capacities regime

Theorem (Propagation of chaos-like result)

There exists a function ρ(p) such that for all k, if stations 1, . . . k have parameter p1, . . . pk, then, as N goes to infinity : P(#{bikes in stations j} = ij for j = 1..k) ∝

k

  • j=1

ρ(pj)ij Depending on popularity, stations have different behaviors : Popular start → Popular destination

homogeneous Heterogeneous Control Conclusion and future work 17/28

slide-24
SLIDE 24

Finite-capacity : numerical example

Two types of stations : popular and non-popular for arrivals : λ1/λ2 = 2.

  • Prop. of

problematic stations Fleet size s Performance is not optimal for a fleet size C/2

homogeneous Heterogeneous Control Conclusion and future work 18/28

slide-25
SLIDE 25

Infinite capacities can worsen the situation

homogeneous Heterogeneous Control Conclusion and future work 19/28

slide-26
SLIDE 26

Infinite capacities can worsen the situation

Theorem (Malyshev-Yakovlev 96)

When the stations have infinite capacity, then there exists sc :

◮ if s < sc, a station behaves as a M/M/1/K. ◮ if s > sc, bikes will accumulate in a few stations.

Example with µ = 1, p = (2, 1, 1, 1, 1, 1, 1, 1, 1)/10 :

s = 1 < sc s = 3 > sc

homogeneous Heterogeneous Control Conclusion and future work 19/28

slide-27
SLIDE 27

Outline

Detailed study of the homogeneous case Adding some heterogeneity Improvement by frustrating some demand Conclusion and future work

homogeneous Heterogeneous Control Conclusion and future work 20/28

slide-28
SLIDE 28

Having finite capacities prevent saturation of the demand. What if we could frustrate some demand ?

Model : we have a trip demand Λij(t) and an accepted demand λij(t).

◮ Generous policy : λij(t) := Λij(t) ◮ Possible control λij(t) ≤ Λij(t)

homogeneous Heterogeneous Control Conclusion and future work 21/28

slide-29
SLIDE 29

Frustrating demand can improve the balance of bikes

A B C 10 10 1 1 10 10 Users want to go to C. Almost nobody wants to go to A or B. Rate of trips (infinite capacities, infinite vehicles) Generous policy ≈ 6 trips / time unit

homogeneous Heterogeneous Control Conclusion and future work 22/28

slide-30
SLIDE 30

Frustrating demand can improve the balance of bikes

A B C 10 10 1 1 0 ≤ 10 0 ≤ 10 Users want to go to C. Almost nobody wants to go to A or B. Rate of trips (infinite capacities, infinite vehicles) Generous policy ≈ 6 trips / time unit Frustrating policy 20 trips / time unit

homogeneous Heterogeneous Control Conclusion and future work 22/28

slide-31
SLIDE 31

Frustrating demand can improve the balance of bikes

A B C 10 10 1 1 0 ≤ 1 ≤ 10 0 ≤ 1 ≤ 10 Users want to go to C. Almost nobody wants to go to A or B. Rate of trips (infinite capacities, infinite vehicles) Generous policy ≈ 6 trips / time unit Frustrating policy 20 trips / time unit Optimal circulation 24 trips / time unit

homogeneous Heterogeneous Control Conclusion and future work 22/28

slide-32
SLIDE 32

We can explore dynamic scenarios [Waserhole/Jost 2012]

Tides in Paris

homogeneous Heterogeneous Control Conclusion and future work 23/28

slide-33
SLIDE 33

Simulation results : Static time-varying frustration of user can improve the situation

Trips per Second

homogeneous Heterogeneous Control Conclusion and future work 24/28

slide-34
SLIDE 34

Simulation results : Static time-varying frustration of user can improve the situation

Trips per Second

  • 1. half capacity is not optimal
  • 2. Room for improvement
  • 3. Far from the theoretical bound

homogeneous Heterogeneous Control Conclusion and future work 24/28

slide-35
SLIDE 35

Outline

Detailed study of the homogeneous case Adding some heterogeneity Improvement by frustrating some demand Conclusion and future work

homogeneous Heterogeneous Control Conclusion and future work 25/28

slide-36
SLIDE 36

Methodological comments : the asymptotic method comes from statistical mechanics (mean-field approximation)

◮ Basic models are reversible.

◮ Saddle-points methods can also be used. homogeneous Heterogeneous Control Conclusion and future work 26/28

slide-37
SLIDE 37

Methodological comments : the asymptotic method comes from statistical mechanics (mean-field approximation)

◮ Basic models are reversible.

◮ Saddle-points methods can also be used. homogeneous Heterogeneous Control Conclusion and future work 26/28

slide-38
SLIDE 38

Summary

Asymptotic results for a large class of bike-sharing network.

◮ Performance poor, even for symmetric : 1/C problematic stations. ◮ Simple incentives can help a lot : 2−C. ◮ Frustrating some users improves overall usage.

Possible extensions of this model

◮ Optimal regulation rate : λ/C. ◮ Reservation : increases congestion.

homogeneous Heterogeneous Control Conclusion and future work 27/28

slide-39
SLIDE 39

Discussion

◮ Metrics are not easy to define. ◮ Visualization of traces and Influence of geometry ?

homogeneous Heterogeneous Control Conclusion and future work 28/28

slide-40
SLIDE 40

Discussion

◮ Metrics are not easy to define. ◮ Visualization of traces and Influence of geometry ?

If an ideal symmetric system works poorly, do not expect perfect service in a real system ;)

homogeneous Heterogeneous Control Conclusion and future work 28/28

slide-41
SLIDE 41

References

◮ C Fricker, N Gast. Incentives and redistribution in homogeneous

bike-sharing systems with stations of finite capacity. EURO Journal

  • n Transportation and Logistics. 2014.

◮ C Fricker, N Gast, H Mohamed. Mean field analysis for

inhomogeneous bike sharing systems DMTCS Proceedings, 2012.

◮ V.A. Malyshev and A. V. Yakovlev. Condensation in large closed

Jackson networks. Ann. Appl. Proba. 1996.

◮ A. Waserhole, V. Jost Vehicle Sharing System Pricing Regulation : A

Fluid Approximation. 2012

◮ N. Gast. The Power of Two Choices on Graphs : the

Pair-Approximation is Accurate. ACM Sigmetrics Perf. Eval Rev. 2015.

◮ Gast, N. and Massonnet, G. and Reijsbergen, D. and Tribastone, M.

Probabilistic forecasts of bike-sharing systems for journey planning. ACM CIKM 2015

1/1