Abstract

Aiming at the various problems with the scheduling of urban public bicycles, this paper conducted a research on the shortest path between rental points and employed the Floyd algorithm to find the optimal route. Based on the conditions of limited number of bicycle transportation vehicles and in different time slots the bicycle rental points were required to restore to the original number of bicycles, a constraint scheduling model was established according to the bicycle supply-demand relationships of the rental points, and the Genetic Algorithm (GA) was used to solve the model to find the shortest path. In terms of balancing the bicycles at each rental point, this paper re-distributed the initial bicycles according to the different demands of each rental point in different time slots, and solved the problem using the solution of the first problem to obtain the optimal vehicle route. This research is a useful reference for solving difficulties in public bicycle scheduling.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call