Because I didn't see the coordinates of each point and the bicycle rental table, I generalized the model and gave a general idea, which needs to be adjusted by the landlord according to the data:

Model construction;

The minimum W=∑wi i= 1, 2,3 3.... 10/0.

The dispatching fee for each station shall be:

w 1 =∑di 1ni 1 * 1i = 2，3，4，5，6，7，8，8， 10

w2=∑di2ni2* 1 i= 1，3，4，5，6，7，8，9， 10

w3=∑di3ni3* 1 i= 1，2，4，5，6，7，8，9， 10

w4=∑di4ni4* 1 i= 1，2，3.5，6，7，8，9， 10

w5=∑di5ni5* 1 i= 1，2.3，4，6，7，8，9， 10

......

w 10 =∑di 10ni 10 * 1i = 1，2，3，4，5，6，7，8，9

dij= 1.4[(xi^2-xj^2)+(yi^2-yj^2)]^ 1/2

solve

Symbolic description;

W total cost of single vehicle dispatching;

Wi's cost of dispatching bicycles to the I-th rental point;

Dij's distance from the i-th lease point to the j-th lease point;

The number of nij transferred from the i-th lease point to the j-th lease point.

Note: 1. Your model only needs to list the equations of the rental points with insufficient cars the next morning, instead of listing all ten rental points.

2, because I didn't see the table, so n should have a range (the maximum value is the total number of redundant bicycles; The minimum value is the vacancy of each station, the optimistic maximum value is the total number of ten rental points, and the minimum value is the number of bicycles missing from a single rental point)

I don't know if I made it clear, hehe.