Direct demand modeling is a useful tool to estimate the demand of urban rail transit stations and to determine factors that significantly influence such demand. The construction of a direct demand model involves determination of the catchment area. Although there have been many methods to determine the catchment area, the choice of those methods is very arbitrary. Different methods will lead to different results and their effects on the results are still not clear. This paper intends to investigate this issue by focusing on three aspects related to the catchment area: size of the catchment area, processing methods of the overlapping areas, and whether to apply the distance decay function on the catchment area. Five catchment areas are defined by drawing buffers around each station with radius distance ranging from 300 to 1500 meters with the interval of 300 meters. Three methods to process the overlapping areas are tested, which are the naïve method, Thiessen polygon, and equal division. The effect of distance decay is considered by applying lower weight to the outer catchment area. Data from five cities in the United States are analyzed. Built environment characteristics within the catchment area are extracted as explanatory variables. Annual average weekday ridership of each station is used as the response variable. To further analyze the effect of regression models on the results, three commonly used models, including the linear regression, log-linear regression, and negative binomial regression models, are applied to examine which type of catchment area yields the highest goodness-of-fit. We find that the ideal buffer sizes vary among cities, and different buffer sizes do not have a great impact on the model’s goodness-of-fit and prediction accuracy. When the catchment areas are heavily overlapping, dividing the overlapping area by the number of times of overlapping can improve model results. The application of distance decay function could barely improve the model results. The goodness-of-fit of the three models is comparable, though the log-linear regression model has the highest prediction accuracy. This study could provide useful references for researchers and planners on how to select catchment areas when constructing direct demand models for urban rail transit stations.

Direct ridership models can predict station-level urban rail transit ridership. Previous research indicates that the direct modeling of urban rail transit ridership uses different coverage overlapping area processing methods (such as naive method or Thiessen polygons), area analysis units (such as census block group and census tract), and various regression models (such as linear regression and negative binomial regression). However, the selection of these methods and models seems arbitrary. The objective of this research is to suggest methods of station-level urban rail transit ridership model selection and evaluate the impact of this selection on ridership model results and prediction accuracy. Urban rail transit ridership data in 2010 were collected from five cities: New York, San Francisco, Chicago, Philadelphia, and Boston. Using the built environment characteristics as the independent variables and station-level ridership as the dependent variable, an analysis was conducted to examine the differences in the model performance in ridership prediction. Our results show that a large overlap of circular coverage areas will greatly affect the accuracy of models. The equal division method increases model accuracy significantly. Most models show that the generalized additive models have lower mean absolute percentage errors (MAPE) and higher adjusted values. By comparison, the Akaike information criterion (AIC) values of the negative binomial models are lower. The influence of different basic spatial analysis unit on the model results is marginal. Therefore, the selection of basic area unit can use existing data. In terms of model selection, advanced models seem to perform better than the linear regression models.

Shared bikes can help cities achieve carbon neutrality goals. Cleaning and disinfection are vital procedures of the maintenance of shared bikes, especially during the COVID-19 pandemic because shared bikes could be a transmission intermediary of viruses. This study proposes an optimization model of the cleaning and disinfection scheme of the dockless shared bikes. The disinfection is assumed to be performed at night, when the usage is lowest. By regarding the disinfection staff as traveling salesmen, the model is formulated as an extension of the Multidepot Multiple Traveling Salesman Problem (MDMTSP). The objective function is to minimize the total cost; which consists of the cost associated with the working time and per-capita cost of the disinfection staff. A heuristic algorithm combining -means clustering and genetic algorithm (K-GA) is adopted to find the lower bound solution. Then, the K-GA-adjustment algorithm has been adopted to find the solutions that satisfy the constraints. To reduce the computing time needed, an approximate function for the lower bound of the optimal number of disinfection staff is obtained by constructing a Continuous Approximation (CA) model. A case study based on real location data of shared bikes in Chengdu, China, is performed to show how the maintenance department could adopt the optimization framework to design an efficient scheme to clean and disinfect the shared bikes.