H. Li, H.X. Chen
The shared bicycle scheduling path planning problem is essentially a VRP problem with capacity constraints. This paper proposes a vehicle routing problem considering the priority of distribution and not returning to the supply point after completing the distribution task (VRPPNR for short). Establishes a combined optimization model for this problem with the goal of minimizing the total transportation distance. And the ant colony algorithm is used to solve the model. Then, this paper verifies the feasibility of the model and method with an actual case. Finally, the model is extended and applied to the case where all demand points have the same priority. The results show that the model and method can be applied to the scheduling path planning of shared bikes and can provide a good reference for shared bike enterprises in selecting the best distribution path scheme.
Keywords: shared bicycle dispatching; VRP; Priority; Ant colony algorithm