Bike sharing dispatching method based on fractal tree self-balance division

Abstract

The present invention provides a bike sharing dispatching method based on fractal tree self-balance division. The method comprises the steps of: the step 1, constructing a self-balance dispatching area partitioning model based on a fractal tree; the step 2, constructing a fractal tree self-balance area partitioning algorithm (FSPA) of BSS dispatching; the step 3, inquiring whether a leaf-level dispatching area has a service points requiring dispatching or not, wherein if the dispatching demand amount of the leaf-level area is smaller than the number of the area service points, cross-area dispatching is not participated in, and internal balance is only needed in the area itself; and when the dispatching demand amount of the leaf-level area is larger than the number of area service points, performing cross-area bike dispatching required by the leaf-level area in the branchknot-level area. When the branchknot-level area of the BSS cannot perform self-balance and needs cross-area dispatching, and the method is similar to the balance dispatching of the leaf-level area so as to finally complete the dispatching of the whole area.

Description

technical field [0001] The invention relates to an area scheduling method for shared bicycles, which belongs to the field of intelligent transportation. Background technique [0002] Shared bicycle system (BSS, Bike Sharing System) has been widely used all over the world. At present, it is mainly divided into public bicycle system with lock pile and shared bicycle without pile pile. As a service, shared bicycles solve the problem of disorderly parking through electronic fences. Whether it is a fixed service station or an electronic fence, there is a limitation on the parking capacity of bicycles. Due to the uneven distribution of time and space such as traffic tides, the difficulty of renting and returning cars has become a prominent long-term problem in the development of BSS. Rebalancing the BSS by dispatching vehicles can effectively alleviate the difficulty of renting and returning cars. However, if the large-scale BSS system does not use partition scheduling, it often...

AI Technical Summary

Problems solved by technology

However, if the large-scale BSS system does not use partition scheduling, it often takes a long time to solve the algorithm, the real-time scheduling is poor, and the cost increases.

Images