Author(s)

Chenggong Yu, Xiubang Li, Xiaoxia Li

Corresponding Author

Xiubang Li

ABSTRACT

Sharing-bikes are characterized by health, greenness and environmental protection, effectively solving the "last kilometer" problem. It is of great significance to reasonably plan the sharing-bike connecting rail transit routes to meet the traveler's needs, build safe urban traffic travel environment, and guide bicycle travel. Based on the shared bicycle trip data, this paper proposes an optimal paved lane path planning model for a sharing-bike connected rail transit based on traffic network. Based on spatial clustering and improved Dijkstra's algorithm, the steps and principles for solving the model are given. The results of the example of Beijing No. 2 Line as a planning example show that this model has the characteristics of convenience of route layout and deployment cost, and has certain feasibility, which enriches the path planning method of bicycle lanes.

KEYWORDS

Urban traffic, path planning, sharing-bikes, Dijkstra algorithm