This study developed an analytical framework that aims at understanding the evolutionary processes of a micro-mobility system (for example, bike-sharing), which offers insights into the transforming nature of a city transport system. Firstly, the framework applied a Gaussian Mixture Model to examine the long-term fluctuations of travel demands. Secondly, it investigated the growth trajectories of service points via exponential and logistic growth models. Cumulative connections with other points represented the growth of a service location. An eigendecomposition approach was used to uncover the hidden structures behind the growth curves. This framework was applied in the docked bike-sharing program in New York City, USA. The results show that there existed periodic patterns of travel demands in the long term. The majority of stations grew rapidly after they began to operate. However, the temporal signatures of stations’ growth displayed some variations across different locations. This proposed workflow can be employed in other cities with similar context to better investigate how micro-mobility systems evolve.
Bike-sharing systems with convenience and flexibility have been appearing more and more in cities and become a necessary tool of travel for people. However, the distribution of bikes is highly unbalanced due to the changes in user demand, which leads to the unfavorable situation of “no bikes available” or “too many bikes” at some bike stations. For this reason, this paper proposes a hybrid scheduling method, which combines truck-based scheduling (TBS) and user-based scheduling (UBS). Firstly, a hybrid scheduling model (HBS) combining TBS and UBS is established. Secondly, a method combining multilayer perceptron and genetic algorithm (MLP-GA) is proposed to solve the model. Thirdly, the HBS model is simulated and analyzed by the example. The results show that the MLP-GA method converges, has a faster running time than the genetic algorithm and can obtain solutions with lower total cost and shorter optimal truck path. Further analysis shows that HBS is more implementable in practice and can shorten the optimal truck path and reduce the scheduling total cost while allowing users to use the shared bike in an affordable way, thus realizing the efficient operation of the shared bike system. Finally, a sensitivity analysis of the reward coefficients is performed. This shows that as the reward coefficient increases, the cost of HBS generally shows an increasing trend when the reward coefficient is small, reaches a maximum value when the reward coefficient is 0.6, and decreases slightly thereafter.
A rising volume of vessel traffic increases navigation density, which leads to an increasing risk of vessel collisions in navigation channels. Navigation safety issues have been widely studied with the aim of reducing such collisions. Intelligent navigation channels, which involve deploying remote-sensing radars on buoys, are an effective method of tackling vessel collisions. This paper investigates the problem of radar deployment in navigation channels, aiming to expand the radar coverage area and effectively detect vessel locations. A mixed-integer linear programming model is formulated to determine the optimal deployment of radars in navigation channels under a given budget, where radars with different coverage radii and different types of buoys are introduced. Then, sensitivity analyses involving the impacts of budgets, the coverage radii of the radars, the distance between adjacent discrete locations, and the distribution of the existing buoys on the radar deployment plan are conducted. The computational results indicate that the coverage ratio of the navigation channel can be improved by reasonably deploying the different types of radars on the existing and new buoys under a given budget.