Table 2.

The calculation procedures for environmental benefits of all bike-sharing trips.

1	Extract the road network for vehicles in Beijing with OSMnx, which is denoted as $G_v\left(N_v,L_v\right),$where $N_v$ and $L_v$ is the set of nodes and links of the road network for vehicles.
2	When trip distance $\mathit{d}$ of bike sharing is larger than the threshold$\theta ,$ step (3)-(6) are conducted repeatedly:
3	Find the nearest point locations of ${(O}_{\mathit{lon}}{,O}_{\mathit{lat}})$ and ${(D}_{\mathit{lon}}{,D}_{\mathit{lat}})$from $G_v$, denoted as ${(O_v\text{'}}_{\mathit{lon}}{,O_v\text{'}}_{\mathit{lat}})$ and ${(D_v\text{'}}_{\mathit{lon}}{,D_v\text{'}}_{\mathit{lat}})$.
4	Input ${(D_v\text{'}}_{\mathit{lon}}{,D_v\text{'}}_{\mathit{lat}})$, ${(D_v\text{'}}_{\mathit{lon}}{,D_v\text{'}}_{\mathit{lat}})$and ${\mathit{G}}_{\mathit{v}}$, utilizing Dijkstra algorithm to calculate the shortest paths of all potential vehicle trips.
5	Save the distance length $d^{\text{'}}$of the shortest paths of potential vehicle usage as$R_v.$
6	Based on Eqs. (1), (2), calculate the potential fuel consumption $E$ and emission $M_i$, namely, environmental benefits of one bike-sharing trip.
7	Add up potential fuel consumption $E$ and emission $M_i$ of all bike-sharing trips, and environmental benefits of bike sharing are obtained.