Accurate and efficient scheduling of shared bicycles is one of the key problems to be solved. This problem can be regarded as a Non-deterministic Polynomial Complete Problem affected by time, place, population and other factors. Currently, study on this problem is still far from mature in our country. Regarding actual bicycle scheduling, considering the constraints of scheduling capacity and site satisfaction, and based on the Travelling Salesman Problem, a comprehensively and maximally optimized mathematical model of scheduling shared bicycles between sites is provided. Then, Tabu Search-Particle Swarm Optimization (TS-PSO) algorithm of multi-objective problem is adopted to solve the above model. Finally, this algorithm is used to solve the practical problem. The results show that a comprehensively optimal scheduling route can be achieved through the algorithm.